On the choice of parameters for power-series interior point algorithms in linear programming

DOI10.1007/BF01585757zbMath0832.90079OpenAlexW2024014783MaRDI QIDQ1804368

Gongyun Zhao

Publication date: 14 May 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

parameter transformationbest parameterhigher-order interior point algorithmspower-series algorithms

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A multiplicative barrier function method for linear programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• On the complexity of following the central path of linear programs by linear extrapolation. II
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Power Series Variants of Karmarkar-Type Algorithms

This page was built for publication: On the choice of parameters for power-series interior point algorithms in linear programming