Pattern search methods for linearly constrained minimization

SIAM Journal on Optimization

Volumn 10, Issue 3, 2000, Pages 917-941

  Lewis, Robert Michael ^a   Torczon, Virginia ^a,b  

^a NASA LANGLEY RESEARCH CENTER   (United States)

^b Asian and Middle Eastern Studies Program   (United States)

Author keywords

Linearly constrained minimization; Pattern search

Indexed keywords

EID: 0034412352     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497331373     Document Type: Article

References (17)

1. D. M. AVIS AND K. FUKUDA, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Comput. Geom., 8 (1992), pp. 295-313.
2. J. V. BURKE AND J. J. MORÉ, On the identification of active constraints, SIAM J. Numer. Anal., 25 (1988), pp. 1197-1211.
3. J. V. BURKE AND J. J. MORÉ, Exposing constraints, SIAM J. Optim., 4 (1994), pp. 573-595.
4. P. H. CALAMAI AND J. J. MORÉ, Projected gradient methods for linearly constrained problems, Math. Programming, 39 (1987), pp. 93-116.
5. C. DAVIS, Theory of positive linear dependence, Amer. J. Math., 76 (1954), pp. 733-746.
6. J. C. DUNN, Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM J. Control Optim., 19 (1981), pp. 368-400.
7. R. HOOKE AND T. A. JEEVES, Direct search solution of numerical and statistical problems, J. Assoc. Comput. Mach., 8 (1961), pp. 212-229.
8. R. M. LEWIS AND V. J. TORCZON, Pattern search algorithms for bound constrained minimization, SIAM J. Optim., 9 (1999), pp. 1082-1099.
9. R. M. LEWIS AND V. J. TORCZON, Rank Ordering and Positive Bases in Pattern Search Algorithms, Tech. Rep. 96-71, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA, 1996.
10. R. M. LEWIS AND V. J. TORCZON, A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds, Tech. Rep. 98-31, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA, 1998; also available online from http://www.icase.edu/library/reports/rdp/1998.html#98-31; SIAM J. Optim., submitted.
11. J. H. MAY, Linearly Constrained Nonlinear Programming: A Solution Method That Does Not Require Analytic Derivatives, Ph.D. thesis, Yale University, New Haven, CT, 1974.
12. R. MIFFLIN, A superlinearly convergent algorithm for minimization without evaluating derivatives, Math. Programming, 9 (1975), pp. 100-117.
13. J. J. MOREAU, Décomposition orthgonale d'un espace hilbertien selon deux cônes mutuellement polaires, C. R. Acad. Sci. Paris, 255 (1962), pp. 238-240.
14. V. TORCZON, On the convergence of the multidirectional search algorithm, SIAM J. Optim., 1 (1991), pp. 123-145.
15. V. TORCZON, On the convergence of pattern search algorithms, SIAM J. Optim., 7 (1997), pp. 1-25.
16. J. VAN TIEL, Convex Analysis: An Introductory Text, John Wiley & Sons, New York, 1984.
17. E. H. ZARANTONELLO, Projections on convex sets in Hilbert space and spectral theory, in Contributions to Nonlinear Functional Analysis, E. H. Zarantonello, ed., Academic Press, New York, 1971, pp. 237-424.