On the complexity of a combined homotopy interior method for convex programming

DOI10.1016/j.cam.2005.12.018zbMath1113.65063MaRDI QIDQ859861

Bo Yu, Qing Xu, Guo-Chen Feng

Publication date: 22 January 2007

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.12.018

zbMATH Keywords

interior-point method; homotopy method; path-following; polynomiality; convex nonlinear optimization

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C51: Interior-point methods

Cites Work

• A new polynomial-time algorithm 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
• Interior point methods of mathematical programming
• Interior point techniques in optimization. Complementarity, sensitivity and algorithms
• A combined homotopy interior point method for convex nonlinear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• The Projective SUMT Method for Convex Programming
• A path following algorithm for a class of convex programming problems
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item