A Primal-dual affine scaling algorithm with necessary centering as a safeguard

DOI10.1080/02331939508844153MaRDI QIDQ4351192zbMATHzbMATHOpenAlexFDO

Authors Gongyun Zhao, Jishan Zhu, Jie Sun

Publication date 11 November 1997

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

predictor-corrector algorithminterior point algorithmprimal-dual affine scaling

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
• A Low Complexity Interior-Point Algorithm for Linear Programming
• A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
• On the symmetric affiine scaling algorithm for line programming^*
• Interior path following primal-dual algorithms. I: Linear programming

Cites work

• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• An implementation of Karmarkar's algorithm for linear programming
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming

Cited in

(2)

• Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*

This page was built for publication: A Primal-dual affine scaling algorithm with necessary centering as a safeguard

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