The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
Open accessAbstract
We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and Toint [SIAM J. Numer. Anal., 28 (1991), pp. 545--572]. In the pattern search adaptation, we solve the bound constrained subproblem approximately using a pattern search method. The stopping criterion proposed by Conn, Gould, and Toint for the solution of the subproblem requires explicit knowledge of derivatives. Such information is presumed absent in pattern search methods; however, we show how we can replace this with a stopping criterion based on the pattern size in a way that preserves the convergence properties of the original algorithm. In this way we proceed by successive, inexact, bound constrained minimization without knowing exactly how inexact the minimization is. As far as we know, this is the first provably convergent direct search method for general nonlinear programming.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Himmelblau, D. M. (1972) · Cited by 2,532
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
Spendley, W., Hext, G. R., & Himsworth, F. R. (1962) · Technometrics · doi:10.1080/00401706.1962.10490033 · Cited by 1,379
On the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
Self-citationA New Method of Constrained Optimization and a Comparison With Other Methods
Box, M. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.1.42 · Cited by 1,302
Conn, A. R., Gould, N. I. M., & Toint, P. (1991) · SIAM Journal on Numerical Analysis · doi:10.1137/0728030 · Cited by 873
Evolutionary Operation: A Method for Increasing Industrial Productivity
Box, G. E. P. (1957) · Applied Statistics · doi:10.2307/2985505 · Cited by 576
Pattern Search Algorithms for Bound Constrained Minimization
Lewis, R. M., & Torczon, V. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623496300507 · Cited by 494
Self-citationNonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971316 · Cited by 470
A dual approach to solving nonlinear programming problems by unconstrained optimization
Rockafellar, R. T. (1973) · Mathematical Programming · doi:10.1007/bf01580138 · Cited by 443
Pattern Search Methods for Linearly Constrained Minimization
Lewis, R. M., & Torczon, V. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497331373 · Cited by 395
Self-citationThe Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
Carroll, C. W. (1961) · Operations Research · doi:10.1287/opre.9.2.169 · Cited by 313
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1992) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-12211-2 · Cited by 295
Direct Search Methods on Parallel Machines
Dennis, J. E., & Torczon, V. (1992) · Operations Research ’91 · doi:10.1007/978-3-642-48417-9_2 · Cited by 279
Self-citationOn the Convergence of the Multidirectional Search Algorithm
Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801010 · Cited by 260
Self-citationNon-linear optimization techniques;
Box, M. J., Davies, D., & Swann, W. H. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 251
Multidirectional search: a direct search algorithm for parallel machines
Torczon, V. J., & Dennis, J. E. (1989) · Rice Research Repository (Rice University) · Cited by 201
Self-citationDiagonalized multiplier methods and quasi-Newton methods for constrained optimization
Tapia, R. A. (1977) · Journal of Optimization Theory and Applications · doi:10.1007/bf00933161 · Cited by 172
Constrained Nonlinear Optimization by Heuristic Programming
Paviani, D. A., & Himmelblau, D. M. (1969) · Operations Research · doi:10.1287/opre.17.5.872 · Cited by 47
A superlinearly convergent algorithm for minimization without evaluating derivatives
Mifflin, R. B. (1975) · Mathematical Programming · doi:10.1007/bf01681333 · Cited by 46
Cited by
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Self-citationDerivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Mesh Adaptive Direct Search Algorithms for Constrained Optimization
Audet, C., & Dennis, J. E. (2006) · SIAM Journal on Optimization · doi:10.1137/040603371 · Cited by 1,243
Analysis of Generalized Pattern Searches
Audet, C., & Dennis, J. E. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400378742 · Cited by 1,022
Pattern Search Methods for Linearly Constrained Minimization
Lewis, R. M., & Torczon, V. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497331373 · Cited by 395
Self-citation
Metadata
- Authors
- Lewis, R. M., & Torczon, V.
- Venue
- SIAM Journal on Optimization
- Published
- 2002-01
- Volume
- 12
- Issue
- 4
- Pages
- 1075-1089
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2084186221
- Cited by
- 315
- References
- 24
- FWCI
- 7.32
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.