New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming
From MaRDI portal
Publication:2867429
DOI10.1080/10556788.2012.679270zbMath1310.65065OpenAlexW2070428866MaRDI QIDQ2867429
Ximei Yang, Chang-He Liu, Hong-Wei Liu
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.679270
semidefinite programminginterior-point methodspolynomial complexitypredictor-corrector algorithmMehrotra-type algorithm
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Interior-point methods (90C51)
Related Items (4)
On the extension of an arc-search interior-point algorithm for semidefinite optimization ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
Cites Work
- Unnamed Item
- Unnamed Item
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Symmetric primal-dual path-following algorithms for semidefinite programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- 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
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- Linear Matrix Inequalities in System and Control Theory
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- 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
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior-Point Method for Semidefinite Programming
- 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: New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming
