Quadratic Convergence in a Primal-Dual Method
From MaRDI portal
Publication:3140544
DOI10.1287/moor.18.3.741zbMath0794.90034OpenAlexW2164391283MaRDI QIDQ3140544
Publication date: 28 November 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.18.3.741
quadratic convergenceasymptotic convergence analysispredictor- corrector primal-dual interior-point algorithm
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Superlinear convergence of the affine scaling algorithm, Limiting behavior of weighted central paths in linear programming, Asymptotic convergence in a generalized predictor-corrector method, Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems, Fast convergence of the simplified largest step path following algorithm, The largest step path following algorithm for monotone linear complementarity problems, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils, Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory, Corrector-predictor methods for sufficient linear complementarity problems, Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem, On the convergence of primal-dual interior-point methods with wide neighborhoods, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems, Degeneracy in interior point methods for linear programming: A survey, Finding an interior point in the optimal face of linear programs, On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP, A primal-dual affine-scaling potential-reduction algorithm for linear programming
