A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization

DOI10.1016/j.amc.2013.12.070zbMath1410.90230OpenAlexW1982259806MaRDI QIDQ1644574

Mohamed Achache, Loubna Guerra

Publication date: 21 June 2018

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

Full work available at URL: https://doi.org/10.1016/j.amc.2013.12.070

zbMATH Keywords

interior point methodspolynomial complexityconvex quadratic semidefinite optimizationshort-step primal-dual algorithms

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items (7)

Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ An interior-point algorithm for semidefinite least-squares problems. ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization ⋮ A class of new search directions for full-NT step feasible interior point method in semidefinite optimization ⋮ Unnamed Item ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term

Uses Software

• QSDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for convex quadratic semi-definite optimization
• A new primal-dual path-following method for convex quadratic programming
• An inexact spectral bundle method for convex quadratic semidefinite programming
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• An inexact primal-dual path following algorithm for convex quadratic SDP
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• A potential reduction algorithm for an extended SDP problem
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• New complexity analysis of the primal-dual Newton method for linear optimization
• A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps

This page was built for publication: A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization