Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming

DOI10.1080/02331934.2011.571257zbMath1262.90192OpenAlexW1993818022MaRDI QIDQ4916315

Yinghong Xu, Lipu Zhang, Li-Ming Sun

Publication date: 22 April 2013

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite optimizationiteration boundfull-Newton stepinfeasible interior-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51)

Related Items (9)

A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP ⋮ A corrector–predictor path-following algorithm for semidefinite optimization ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A full NT-step infeasible interior-point algorithm for semidefinite optimization ⋮ Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization

Cites Work

• Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• On the Convergence of the Central Path in Semidefinite Optimization
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming