An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
From MaRDI portal
Publication:2361136
DOI10.1007/s11590-016-0997-5zbMath1471.90166OpenAlexW2291100075MaRDI QIDQ2361136
Yinkui Zhang, Ximei Yang, Hong-Wei Liu
Publication date: 29 June 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-0997-5
polynomial complexityEuclidean Jordan algebraarc-searchinfeasible-interior-point methodsymmetric optimization
Related Items
A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming ⋮ An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy ⋮ An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints ⋮ A polynomial time infeasible interior-point arc-search algorithm for convex optimization ⋮ On the extension of an arc-search interior-point algorithm for semidefinite optimization ⋮ A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood ⋮ A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ A corrector-predictor arc search interior-point algorithm for symmetric optimization ⋮ An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- High-order predictor-corrector algorithms
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
This page was built for publication: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
