Superlinear convergence of infeasible-interior-point methods for linear programming
From MaRDI portal
Recommendations
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Computational experience with a primal-dual interior point method for linear programming
- Error bounds for nondegenerate monotone linear complementarity problems
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Implementation of a Primal-Dual Interior Point Method
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
- 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
Cited in
(18)- \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
- An infeasible-interior-point algorithm using projections onto a convex set
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- An infeasible-interior-point algorithm for linear complementarity problems
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming
- Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
- Superlinear convergence of interior-point algorithms for semidefinite programming
- On the convergence of a predictor-corrector variant algorithm
- Local Convergence Properties of New Methods in Linear Programming
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
- Optimized choice of parameters in interior-point methods for linear programming
This page was built for publication: Superlinear convergence of infeasible-interior-point methods for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337141)
