Pages that link to "Item:Q5317499"
From MaRDI portal
The following pages link to A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm (Q5317499):
Displaying 7 items.
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms (Q930345) (← links)
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
- A linear programming instance with many crossover events (Q2365418) (← links)
- A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)