On quadratic convergence of the O( nL)-iteration homogeneous and self-dual linear programming algorithm

DOI10.1023/A:1018905724427MaRDI QIDQ1290212zbMATHFDO

Authors Shiquan Wu, Yinyu Ye, Fang Wu

Publication date 10 June 1999

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

duality gapquadratic convergenceinterior-point algorithmsself-dual linear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• Quadratic Convergence in a Primal-Dual Method
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm

Cited in

(6)

• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
• Quadratic Convergence in a Primal-Dual Method
• A new feasible interior-point algorithm with full step for linear optimization based on a simple function
• Simplified infeasible interior-point algorithm for linear optimization based on a simple function
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming
• On two homogeneous self-dual approaches to linear programming and its extensions.

This page was built for publication: On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm

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