Keywords
Affiliated Institutions
Related Publications
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...
A Globally Convergent Primal-Dual Interior-Point Filter Method for Nonconvex Nonlinear Programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primal-dual interior-point algorithm for nonlinear programming, avoiding the use of m...
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...
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
The local convergence properties of a class of primal-dual interior point methods are analyzed. These methods are designed to minimize a nonlinear, nonconvex, objective function...
Interior-Point Polynomial Algorithms in Convex Programming
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynom...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 23
- Issue
- 2
- Pages
- 257-272
- Citations
- 111
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1023/a:1020533003783