A corrector-predictor arc search interior-point algorithm for symmetric optimization
From MaRDI portal
Publication:2313142
Recommendations
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- 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 corrector-predictor path-following method for convex quadratic symmetric cone optimization
Cites work
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 3511136 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- Polynomial time second order mehrotra-type predictor--corrector algorithms
Cited in
(9)- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- A new corrector-predictor interior-point method for symmetric cone optimization
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- An arc-search interior point method in the \(\mathcal N^{-}_\infty\) neighborhood for symmetric optimization
- A feasible interior-point method with full-Newton step for P_* ( )-weighted linear complementarity problem via the algebraically equivalent transformation
This page was built for publication: A corrector-predictor arc search interior-point algorithm for symmetric optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313142)
