An O( nL) wide neighborhood interior-point algorithm for semidefinite optimization
From MaRDI portal
(Redirected from Publication:520262)
An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
Recommendations
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
- 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
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
Cites work
- scientific article; zbMATH DE number 729680 (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 full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new second-order corrector interior-point algorithm for semidefinite programming
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A primal-dual potential reduction method for problems involving matrix inequalities
- 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
- 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 n L)\) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Full-Newton step infeasible interior-point algorithm for SDO problems
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Linear Matrix Inequalities in System and Control Theory
- Neighborhood-following algorithms for linear programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On the Convergence of the Central Path in Semidefinite Optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(17)- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- A note on a wide neighborhood infeasible interior-point algorithm for semidefinite programming
- A new wide neighborhood infeasible interior-point algorithm for semidefinite programming
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A primal-dual interior-point algorithm with arc-search 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 wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
- The research of a modified primal-dual interior-point algorithm for SDP
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
This page was built for publication: An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520262)
