A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
From MaRDI portal
Publication:4835390
DOI10.1287/moor.20.1.135zbMath0834.90088OpenAlexW2144582354MaRDI QIDQ4835390
Michael J. Todd, Shinji Mizuno, Yinyu Ye
Publication date: 31 July 1995
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.20.1.135
Related Items
Global convergence in infeasible-interior-point algorithms, A primal-dual interior point method whose running time depends only on the constraint matrix, An infeasible interior-point algorithm for solving primal and dual geometric programs, A generalized homogeneous and self-dual algorithm for linear programming, Linear programming with stochastic elements: An on-line approach, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, An infeasible-interior-point algorithm using projections onto a convex set, A simplified homogeneous and self-dual linear programming algorithm and its implementation, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, Analytic centers and repelling inequalities
