An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
From MaRDI portal
Publication:2361596
DOI10.1007/s13370-016-0426-zzbMath1365.90168OpenAlexW2340956386MaRDI QIDQ2361596
Publication date: 30 June 2017
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-016-0426-z
Cites Work
- Unnamed Item
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A full-Newton step interior-point algorithm based on modified Newton direction
- A modified infeasible-interior-point algorithm for linear optimization problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
- Feasibility issues in a primal-dual interior-point method for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Similarity and other spectral relations for symmetric cones
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms