A characterization of the optimal set of linear programs based on the augmented lagrangian

DOI10.1080/02522667.1999.10699419zbMath0932.90024OpenAlexW1984589337MaRDI QIDQ4264505

Mustafa Çelebi Pinar

Publication date: 21 March 2000

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1999.10699419

zbMATH Keywords

linear programaugmented Lagrangean

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of the exponential multiplier method for convex programming
• Implementing proximal point methods for linear programming
• Finite termination of the proximal point algorithm
• Proximal minimization algorithm with \(D\)-functions
• Augmented Lagrangian algorithms for linear programming
• New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• A New Finite Continuation Algorithm for Linear Programming