A corrector-predictor arc search interior-point algorithm for symmetric optimization
From MaRDI portal
Publication:2313142
DOI10.1016/S0252-9602(18)30813-0zbMath1438.90360OpenAlexW2809128983MaRDI QIDQ2313142
Publication date: 18 July 2019
Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0252-9602(18)30813-0
interior-point methodspolynomial complexitywide neighborhoodellipsoidal approximationsymmetric optimization
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A polynomial arc-search interior-point algorithm for linear programming
- 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
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
