An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
From MaRDI portal
Publication:1731107
DOI10.1007/s10440-018-0164-3zbMath1417.90139OpenAlexW2794139029MaRDI QIDQ1731107
Publication date: 20 March 2019
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10440-018-0164-3
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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- 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
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Feasibility issues in a primal-dual interior-point method for linear programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- Neighborhood-following algorithms for linear programming
- Barrier Functions in Interior Point Methods
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones