Hessian distances and their applications in the complexity analysis of interior-point methods

DOI10.1080/10556788.2012.737327zbMath1293.90080OpenAlexW2019266326MaRDI QIDQ5299911

Yu Xia, Yu. E. Nesterov

Publication date: 24 June 2013

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.737327

zbMATH Keywords

interior-point methodspolynomial-time methodsconic optimization problemsinfeasible-start schemes

Mathematics Subject Classification ID

Interior-point methods (90C51) Semi-infinite programming (90C34)

Cites Work

• Unnamed Item
• Long-step strategies in interior-point primal-dual methods
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
• A New Infinity-Norm Path Following Algorithm for Linear Programming
• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
• Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path