A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with O(nTr(X^0S^0)) iteration complexity
From MaRDI portal
Publication:3083311
Recommendations
- An \(O(\sqrt nL)\) wide neighborhood 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
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Large-update primal-dual interior-point algorithm for semidefinite optimization
Cited in
(50)- An efficient second-order predictor-corrector infeasible primal-dual IPM algorithm with large iteration path updates for solving well-known SDO problems
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new second-order corrector interior-point algorithm for semidefinite programming
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
- A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- 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 wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian \(P_* (\kappa)\)-LCP over symmetric cones
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- A new infeasible-interior-point algorithm for linear programming over symmetric cones
- An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- Self-regular interior-point methods for semidefinite optimization
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
- A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
- New method for determining search directions for interior-point algorithms in linear optimization
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
- A new wide neighborhood primal-dual predictor-corrector interior-point method for linear programming
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A predictor-corrector infeasible-interior-point method for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones with \(O\left( \sqrt{\mathrm{cond}(G)}(1+\kappa)^2 r\log \varepsilon^{-1} \right)\) iteration complexity
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083311)
