An OnL) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
From MaRDI portal
Publication:5031228
Recommendations
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- A wide neighborhood second-order predictor-corrector interior-point algorithm for semidefinite optimization with modified corrector directions
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 967335 (Why is no real title available?)
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- 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 new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
- A new second-order corrector interior-point algorithm for semidefinite programming
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
- A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- 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 adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- First- and second-order methods for semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Linear Matrix Inequalities in System and Control Theory
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On Mehrotra-Type Predictor-Corrector Algorithms
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- 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
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(14)- An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- A corrector-predictor path-following algorithm for semidefinite optimization
- A new corrector-predictor algorithm for convex quadratic semidefinite optimization
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A wide neighborhood second-order predictor-corrector interior-point algorithm for semidefinite optimization with modified corrector directions
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
This page was built for publication: An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031228)
