A self-adjusting primal–dual interior point method for linear programs

DOI10.1080/10556780310001634109zbMath1140.90510OpenAlexW2016071253MaRDI QIDQ4657821

Shaohua Pan, Xing-Si Li

Publication date: 14 March 2005

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

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

zbMATH Keywords

linear programminginterior point methodproximity measurecentral pathself-adjusting

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items

Solving frictional contact problems by two aggregate-function-based algorithms ⋮ An adaptive-step primal-dual interior point algorithm for linear optimization ⋮ Two aggregate-function-based algorithms for analysis of 3D frictional contact by linear complementarity problem formulation ⋮ A self-adjusting interior point algorithm for linear complementarity problems

Uses Software

• LIPSOL
• NETLIB LP Test Set

Cites Work

• LIPSOL
• A new polynomial-time algorithm for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• On the Implementation of a Primal-Dual Interior Point Method
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• Unnamed Item
• Unnamed Item
• Unnamed Item