A dynamic large-update primal‐dual interior-point method for linear optimization

DOI10.1080/1055678021000039175zbMath1032.90019OpenAlexW2081215000MaRDI QIDQ4405939

Tamás Terlaky, Jiming Peng

Publication date: 22 March 2004

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

polynomial complexityself-regular proximity function

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)

Related Items

An adaptive self-regular proximity-based large-update IPM for LO, An adaptive-step primal-dual interior point algorithm for linear optimization, On self-regular IPMs (with comments and rejoinder), The complexity of self-regular proximity based infeasible IPMs

Uses Software

• LIPSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• On the Implementation of a Primal-Dual Interior Point Method
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods