New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
From MaRDI portal
Publication:2867429
Recommendations
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
- A new second-order Mehrotra-type predictor-corrector algorithm for SDO
- A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An Interior-Point Method for Semidefinite Programming
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Linear Matrix Inequalities in System and Control Theory
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- Symmetric primal-dual path-following algorithms for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(8)- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm 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
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- A Mehrotra-type algorithm for SDP based on a new adaptive updating technique of barrier parameter
- A new second-order Mehrotra-type predictor-corrector algorithm for SDO
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
This page was built for publication: New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867429)
