On the convergence of a predictor-corrector variant algorithm
From MaRDI portal
Publication:2355008
Recommendations
- scientific article; zbMATH DE number 3956350
- A predictor-corrector algorithm for general variational inequalities
- Asymptotic convergence in a generalized predictor-corrector method
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- On Mehrotra-Type Predictor-Corrector Algorithms
- A predictor-corrector algorithm for linearly constrained convex optimization
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- On the order of convergence of modified predictor-corrector method
- scientific article; zbMATH DE number 1066220
Cites work
- \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods
- A new polynomial-time algorithm for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A QMR-based interior-point algorithm for solving linear programs
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Computational experience with a primal-dual interior point method for linear programming
- Convergence behavior of interior-point algorithms
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Improving the rate of convergence of interior point methods for linear programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On Mehrotra-Type Predictor-Corrector Algorithms
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
- Superlinear convergence of infeasible-interior-point methods for linear programming
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Cited in
(3)
This page was built for publication: On the convergence of a predictor-corrector variant algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355008)