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 11 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)
- An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← 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)
