An extension of predictor-corrector algorithm to a class of convex separable program

DOI10.1007/BF02009544zbMath0895.65028OpenAlexW2087481178MaRDI QIDQ1375337

Shiquan Wu, Tian-de Guo

Publication date: 8 September 1998

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

interior-point methodconvex separable programmingMizuno-Todd-Ye predictor-corrector method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming