On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming

DOI10.1287/moor.22.2.408zbMath0883.90093OpenAlexW2095983929MaRDI QIDQ4346229

Jos F. Sturm, Shu-Zhong Zhang

Publication date: 23 March 1998

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/06373fd53cb4f2f803e03406d99073c5757ddafe

zbMATH Keywords

central pathadaptive step primal-dual interior point method

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Interior-point algorithm based on general kernel function for monotone linear complementarity problem, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, A circular cone relaxation primal interior point algorithm for LP, An ADMM-based interior-point method for large-scale linear programming, Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Uses Software

• NETLIB LP Test Set