A class of new search directions for full-NT step feasible interior point method in semidefinite optimization

DOI10.1051/ro/2022192OpenAlexW4307543328MaRDI QIDQ6186557

Loubna Guerra

Publication date: 2 February 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2022192

zbMATH Keywords

interior point methodsemidefinite optimizationpolynomial complexityfull Nesterov-Todd stepalgebraic equivalent transformationnew search directions

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• A new primal-dual path-following method for convex quadratic programming
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• New method for determining search directions for interior-point algorithms in linear optimization
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On the Nesterov--Todd Direction in Semidefinite Programming
• New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On the Convergence of the Central Path in Semidefinite Optimization
• An extension for identifying search directions for interior-point methods in linear optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A class of new search directions for full-NT step feasible interior point method in semidefinite optimization