Keywords
Affiliated Institutions
Related Publications
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...
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...
Determinant Maximization with Linear Matrix Inequality Constraints
The problem of maximizing the determinant of a matrix subject to linear matrix inequalities (LMIs) arises in many fields, including computational geometry, statistics, system id...
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
An exact-penalty-function-based scheme---inspired from an old idea due to Mayne and Polak [Math. Program., 11 (1976), pp.67--80]---is proposed for extending to general smooth co...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 13
- Issue
- 1-3
- Pages
- 231-252
- Citations
- 518
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1023/a:1008677427361