A new second-order corrector interior-point algorithm for semidefinite programming
From MaRDI portal
Publication:1935927
DOI10.1007/s00186-012-0379-4zbMath1277.90093MaRDI QIDQ1935927
Publication date: 20 February 2013
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-012-0379-4
90C22: Semidefinite programming
Related Items
A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization, A new second-order corrector interior-point algorithm for P*(k)-LCP, An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization, A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
Cites Work
- Unnamed Item
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- 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
- Self-regular functions and new search directions for linear and semidefinite optimization
- Neighborhood-following algorithms for linear 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
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On Mehrotra-Type Predictor-Corrector Algorithms
- 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
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Numerical Optimization
- 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
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- 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
- Interior Point Methods for Linear Optimization
