On the solution of linearly constrained optimization problems by means of barrier algorithms

DOI10.1007/s11750-020-00559-wOpenAlexW3027560719MaRDI QIDQ1979175

Ernesto G. Birgin, Sandra Augusta Santos, J. L. Gardenghi, José Mario Martínez

Publication date: 2 September 2021

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-020-00559-w

zbMATH Keywords

convergencenumerical experimentslinearly constrained optimizationfeasible barrier methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Uses Software

• Ipopt
• ALGENCAN
• CUTEst

Cites Work

• A new polynomial-time algorithm for linear programming
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Practical Augmented Lagrangian Methods for Constrained Optimization
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item