A note on the use of vector barrier parameters for interior-point methods

DOI10.1016/j.ejor.2006.08.024zbMath1131.90072OpenAlexW2080308234MaRDI QIDQ877030

Alberto Olivares, Javier M. Moguerza, Francisco Javier Prieto

Publication date: 19 April 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10016/14897

zbMATH Keywords

interior point methodsnon-convex optimizationcentral pathprimal-dual methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Related Items

Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems

Uses Software

• CUTEr
• SifDec

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enlarging the region of convergence of Newton's method for constrained optimization
• An interior-point algorithm for nonconvex nonlinear programming
• Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
• An augmented Lagrangian interior-point method using directions of negative curvature
• Combining search directions using gradient flows
• Primal-dual target-following algorithms for linear programming
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
• Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods
• On the Implementation of a Primal-Dual Interior Point Method
• On the use of directions of negative curvature in a modified newton method
• A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
• A globally convergent primal-dual interior point method for constrained optimization
• CUTEr and SifDec