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

DOI10.1007/S11750-020-00559-WMaRDI QIDQ1979175zbMATH OpenOpenAlexFDO

Authors E. G. Birgin, J. L. Gardenghi, S. A. Santos, J. M. 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

convergencefeasible barrier methodslinearly constrained optimizationnumerical experiments

Mathematics Subject Classification ID

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

Cites work

• A new polynomial-time algorithm for linear programming
• Benchmarking optimization software with performance profiles.
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Practical augmented Lagrangian methods for constrained optimization

Cited in

(1)

• On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs

Describes a project that uses

Uses Software

• Ipopt
• ALGENCAN
• CUTEst

This page was built for publication: On the solution of linearly constrained optimization problems by means of barrier algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979175)