Pages that link to "Item:Q930345"
From MaRDI portal
The following pages link to 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):
Displaying 13 items.
- An analogue of the Klee-Walkup result for sonnevend's curvature of the central path (Q289062) (← links)
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← links)
- Curvature integrals and iteration complexities in SDP and symmetric cone programs (Q404518) (← links)
- The central curve in linear programming (Q695626) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
- Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)
- On the curvature of the central path of linear programming theory (Q2505641) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm (Q5317499) (← links)
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs (Q6138812) (← links)
