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

DOI10.1080/10556780310001634109MaRDI QIDQ4657821zbMATH OpenOpenAlexFDO

Authors Shaohua Pan, Xingsi Li

Publication date 14 March 2005

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

central pathinterior point methodlinear programmingproximity measureself-adjusting

Mathematics Subject Classification ID

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

Recommendations

• A self-adjusting interior point algorithm for linear complementarity problems
• An aggregate-function-based self-adjusting interior point algorithm for solving linear complementarity problems
• scientific article; zbMATH DE number 2104612
• Interior dual proximal point algorithm for linear programs
• Interior path following primal-dual algorithms. I: Linear programming

Cites work

• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• LIPSOL
• On the Implementation of a Primal-Dual Interior Point Method
• 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

(8)

• Two aggregate-function-based algorithms for analysis of 3D frictional contact by linear complementarity problem formulation
• An aggregate-function-based self-adjusting interior point algorithm for solving linear complementarity problems
• An adaptive-step primal-dual interior point algorithm for linear optimization
• scientific article; zbMATH DE number 2104612 (Why is no real title available?)
• scientific article; zbMATH DE number 851571 (Why is no real title available?)
• Solving frictional contact problems by two aggregate-function-based algorithms
• A self-adjusting interior point algorithm for linear complementarity problems
• On central-path proximity measures in interior-point methods

Describes a project that uses

Uses Software

• LIPSOL
• NETLIB LP Test Set

This page was built for publication: A self-adjusting primal–dual interior point method for linear programs

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