Pages that link to "Item:Q1337141"
From MaRDI portal
The following pages link to Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141):
Displaying 19 items.
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming (Q884611) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs (Q1103527) (← links)
- Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
- Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164) (← links)
- An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
- On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs (Q1369364) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
- On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
- Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming (Q2719236) (← links)
- Local Convergence Properties of New Methods in Linear Programming (Q3200876) (← links)
- Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (Q3465241) (← links)
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds (Q4507441) (← links)
- \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods (Q5955563) (← links)
