scientific article; zbMATH DE number 6285133

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

interior-point methodspolynomial complexityEuclidean Jordan algebrasymmetric cone optimization

Mathematics Subject Classification ID

Interior-point methods (90C51)

Related Items

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, A full NT-step infeasible interior-point algorithm for semidefinite optimization, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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