Keywords
Related Publications
On the Convergence of Pattern Search Algorithms
We introduce an abstract definition of pattern search methods for solving nonlinear unconstrained optimization problems. Our definition unifies an important collection of optimi...
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Preface 1. Introduction. Problems to be considered Characteristics of 'real-world' problems Finite-precision arithmetic and measurement of error Exercises 2. Nonlinear Problems ...
On the Global Convergence of a Filter--SQP Algorithm
A mechanism for proving global convergence in SQP-filter methods for nonlinear programming (NLP) is described. Such methods are characterized by their use of the dominance conce...
Computational experience with quadratically convergent minimisation methods
A recently reported minimisation method allows great flexibility in choosing successive steps without losing the property of quadratic convergence, but special precautions are n...
Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
Line search methods are proposed for nonlinear programming using Fletcher and Leyffer's filter method [Math. Program., 91 (2002), pp. 239--269], which replaces the traditional m...
Publication Info
- Year
- 1982
- Type
- article
- Volume
- 26
- Issue
- 3
- Pages
- 532-553
- Citations
- 235
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1137/1126059