On the curvature of the central path of linear programming theory
From MaRDI portal
Publication:2505641
DOI10.1007/s10208-003-0116-8zbMath1119.90370arXivmath/0312083OpenAlexW3102718798MaRDI QIDQ2505641
Gregorio Malajovich, Michael Shub, Jean-Pierre Dedieu
Publication date: 28 September 2006
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0312083
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Numerical computation of solutions to systems of equations (65H10) Interior-point methods (90C51) Computational aspects of algebraic curves (14Q05)
Related Items
Diameter and Curvature: Intriguing Analogies, Log-Barrier Interior Point Methods Are Not Strongly Polynomial, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, On the complexity of analyticity in semi-definite optimization, The degree of the central curve in semidefinite, linear, and quadratic programming, Polytopes and arrangements: diameter and curvature, What Tropical Geometry Tells Us about the Complexity of Linear Programming, Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes, The central curve in linear programming, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, A continuous \(d\)-step conjecture for polytopes, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate