A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming

DOI10.1137/070693461zbMath1179.65068OpenAlexW2095857169MaRDI QIDQ3648536

Renato D. C. Monteiro, Takashi Tsuchiya, Guanghui Lan

Publication date: 27 November 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/10bb439298e962a9a86593ed593ff098e265ef0c

zbMATH Keywords

linear programmingcondition numberpolynomial complexitycentral pathinterior-point algorithmtrust-regionpath-followingpredictor-correctorprimal-dual algorithmsaffine scalingstrongly polynomiallayered steps

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Robust continuation methods for tracing solution curves of parameterized systems ⋮ A predictor-corrector algorithm for linear optimization based on a modified Newton direction ⋮ Deepest point of a polyhedron and linear programming ⋮ A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

This page was built for publication: A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming