A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization

DOI10.1007/s12190-021-01579-wzbMath1486.65060OpenAlexW3172187730MaRDI QIDQ2142525

Behrouz Kheirfam, Naser Osmanpour

Publication date: 27 May 2022

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

Full work available at URL: https://doi.org/10.1007/s12190-021-01579-w

zbMATH Keywords

interior-point methodspredictor-corrector methodssemidefinite optimizationpolynomial complexitywide neighborhood

Mathematics Subject Classification ID

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

Uses Software

• SDPT3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• 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 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
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Linear Matrix Inequalities in System and Control Theory
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
• A Wide Neighborhood Second-order Predictor-corrector Interior-point Algorithm for Semidefinite Optimization with Modified Corrector Directions
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On the Convergence of the Central Path in Semidefinite Optimization
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
• 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: A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization