An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions

DOI10.1007/BF01432508MaRDI QIDQ4859453zbMATH OpenOpenAlexFDO

Authors Shu-Cherng Fang, H.-S. Jacob Tsao

Publication date 7 January 1996

Published in ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

barrier functionsglobally convergent curved-search algorithmKarmarkar-type linear programmingsequence of unconstrained concave programsunconstrained dual approach

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• An unconstrained convex programming view of linear programming
• Implementing an affine scaling algorithm for linear programming
• Deriving an unconstrained convex program for linear programming
• A logarithm barrier method for linear programming
• Unconstrained convex programming approach to linear programming

Cites work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An unconstrained convex programming approach to solving convex quadratic programming problems
• An unconstrained convex programming view of linear programming
• Curved search methods for unconstrained optimization
• scientific article; zbMATH DE number 439946 (Why is no real title available?)
• scientific article; zbMATH DE number 3140613 (Why is no real title available?)
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Least-norm linear programming solution as an unconstrained minimization problem
• Linear programming with entropic perturbation
• Linearly constrained convex programming as unconstrained differentiable concave programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the convex programming approach to linear programming

This page was built for publication: An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions

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