A new O(nL)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
From MaRDI portal
Publication:2348957
Recommendations
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- A wide neighborhood second-order predictor-corrector interior-point algorithm for semidefinite optimization with modified corrector directions
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
Cited in
(24)- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras
- Two wide neighborhood interior-point methods for symmetric cone optimization
- Solvability based on E-property for the nonlinear symmetric cone complementarity problem
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
- 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 primal-dual second-order corrector interior point algorithm for semidefinite optimization
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- An efficient second-order predictor-corrector infeasible primal-dual IPM algorithm with large iteration path updates for solving well-known SDO problems
- A long-step second-order corrector interior point algorithm for linear optimization based on the algebraic equivalent transformation
This page was built for publication: A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348957)