An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood

DOI10.1080/00207160.2020.1748604zbMath1479.90219OpenAlexW3013377889MaRDI QIDQ5031228

M. Mohamadi Sangachin, Behrouz Kheirfam

Publication date: 18 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite optimizationpolynomial complexitywide neighbourhoodpredictor-corrector interior-point method

Mathematics Subject Classification ID

Interior-point methods (90C51)

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• Polynomial time second order mehrotra-type predictor--corrector algorithms
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
• A polynomial path-following interior point algorithm for general linear complementarity problems
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• First- and second-order methods for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• A new second-order corrector interior-point algorithm for semidefinite programming
• A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
• A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
• A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
• A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
• On Mehrotra-Type Predictor-Corrector Algorithms
• On the Implementation of a Primal-Dual Interior Point Method
• On the Nesterov--Todd Direction in Semidefinite Programming
• Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Linear Matrix Inequalities in System and Control Theory
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

This page was built for publication: An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood