A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
From MaRDI portal
Publication:2921914
DOI10.1080/00207160.2013.827784zbMath1297.90112OpenAlexW2027346680MaRDI QIDQ2921914
Ximei Yang, Yinkui Zhang, Hong-Wei Liu
Publication date: 14 October 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2013.827784
semi-definite programmingcomplexity boundwide neighbourhoodmehrotra-type predictor-corrector algorithmSchatten 1-norm
Related Items
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, A note on an inequality involving Jordan product in Euclidean Jordan algebras, A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization, A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization, A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization, An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood
Cites Work
- Unnamed Item
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A unified analysis for a class of long-step primal-dual path-following interior-point 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
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A new second-order corrector interior-point algorithm for semidefinite programming
- Interval programming models for matrix games with interval payoffs
- 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 the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- On the Implementation of a Primal-Dual Interior Point Method
- Large-Scale Optimization of Eigenvalues
- 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
- 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
- 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
