On well definedness of the central path
From MaRDI portal
Publication:1807813
DOI10.1023/A:1021768121263zbMath0941.90061MaRDI QIDQ1807813
L. M. Graña Drummond, Benar Fux Svaiter
Publication date: 19 December 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
90C25: Convex programming
Cites Work
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item