Asymptotic convergence in a generalized predictor-corrector method
From MaRDI portal
Publication:1352296
DOI10.1007/BF02592143zbMath0868.90078MaRDI QIDQ1352296
Publication date: 18 August 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
asymptotic convergenceasymptotic convergence propertiesgeneralized predictor-corrector methodprimal-dual affine scaling
Related Items
Limiting behavior of weighted central paths in linear programming, A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence, A superquadratic infeasible-interior-point method for linear complementarity problems, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- On the finite convergence of interior-point algorithms for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- On finding a vertex solution using interior point methods
- Finding an interior point in the optimal face of linear programs
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Quadratic Convergence in a Primal-Dual Method
- A Centered Projective Algorithm for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
- Iterative Solution of Nonlinear Equations in Several Variables
