Examples of ill-behaved central paths in convex optimization
From MaRDI portal
Publication:1777216
DOI10.1007/s10107-003-0460-0zbMath1079.90099MaRDI QIDQ1777216
Gilbert, Jean Charles, Clóvis C. Gonzaga, Elizabeth W. Karas
Publication date: 12 May 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0460-0
Nonlinear programming; Convex optimization; Penalty function methods; Interior point algorithm; Central path
Related Items
Generalization: One technique of computational and applied mathematical methodology, On some properties and an application of the logarithmic barrier method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- An interior-point algorithm for nonconvex nonlinear programming
- A primal-dual interior point method whose running time depends only on the constraint matrix
- Interior point methods of mathematical programming
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms
- On the existence and convergence of the central path for convex programming and some duality results
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Smoothing methods for convex inequalities and linear complementarity problems
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- Path-Following Methods for Linear Programming
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- A trust region method based on interior point techniques for nonlinear programming.
