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

DOI10.1080/1055678021000039175MaRDI QIDQ4405939zbMATH OpenOpenAlexFDO

Authors Tamás Terlaky, Jiming Peng

Publication date 22 March 2004

Published in Optimization Methods \& 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

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

Recommendations

• On self-regular IPMs (with comments and rejoinder)
• An adaptive self-regular proximity-based large-update IPM for LO
• The complexity of self-regular proximity based infeasible IPMs
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods

Cites work

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

Cited in

(7)

• New complexity analysis of the primal-dual Newton method for linear optimization
• An adaptive-step primal-dual interior point algorithm for linear optimization
• An adaptive self-regular proximity-based large-update IPM for LO
• On self-regular IPMs (with comments and rejoinder)
• The complexity of self-regular proximity based infeasible IPMs
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier

Describes a project that uses

Uses Software

• LIPSOL

This page was built for publication: A dynamic large-update primal‐dual interior-point method for linear optimization

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