Unconstrained convex programming approach to linear programming

DOI10.1007/BF02192167zbMath0842.90084OpenAlexW2047313019MaRDI QIDQ1905944

Yanyan Li

Publication date: 6 August 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192167

zbMATH Keywords

perturbationsapproximation schemeentropic barrier functionsharp upper bound of error estimationunconstrained dual concave program

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Related Items (2)

On the entropic perturbation and exponential penalty methods for linear programming ⋮ On the convex programming approach to linear programming

Cites Work

• Least-norm linear programming solution as an unconstrained minimization problem
• A new polynomial-time algorithm for linear programming
• Deriving an unconstrained convex program for linear programming
• An unconstrained convex programming view of linear programming
• Linear programming with entropic perturbation
• Unnamed Item

This page was built for publication: Unconstrained convex programming approach to linear programming