Pages that link to "Item:Q1338138"
From MaRDI portal
The following pages link to Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138):
Displaying 13 items.
- Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
- Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
- Steplengths in interior-point algorithms of quadratic programming (Q1306349) (← links)
- An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
- A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- A Newton's method for perturbed second-order cone programs (Q2385540) (← links)
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
