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

DOI10.1080/02331939508844153zbMath0874.90136OpenAlexW2005933292MaRDI QIDQ4351192

Jishan Zhu, Gongyun Zhao, 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)

Related Items

A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*

Cites Work

• Unnamed Item
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
• An implementation of Karmarkar's algorithm for linear programming
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming