Publication:5409921
From MaRDI portal
zbMath1320.90105MaRDI QIDQ5409921
Nezam Mahdavi-Amiri, Behrouz Kheirfam
Publication date: 15 April 2014
Full work available at URL: http://www.kybernetika.cz/content/2013/6/883
interior-point methods; polynomial complexity; Euclidean Jordan algebra; symmetric cone optimization
90C51: Interior-point methods
Related Items
Unnamed Item, A full NT-step infeasible interior-point algorithm for semidefinite optimization, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
Cites Work
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Similarity and other spectral relations for symmetric cones
- On a commutative class of search directions for linear programming over symmetric cones
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
