A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
From MaRDI portal
Publication:523579
DOI10.1007/s10589-016-9874-5zbMath1360.90291OpenAlexW2514687199MaRDI QIDQ523579
Tamás Terlaky, Ali Mohammad Nezhad
Publication date: 21 April 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9874-5
interior-point methodEuclidean Jordan algebraDikin-type affine scaling methodsymmetric conic optimization
Related Items
An algorithm for nonsymmetric conic optimization inspired by MOSEK, Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new polynomial-time algorithm for linear programming
- Euclidean Jordan algebras and interior-point algorithms
- Polynomial primal-dual affine scaling algorithms in semidefinite programming
- Extension of primal-dual interior point algorithms to symmetric cones
- An independent benchmarking of SDP and SOCP solvers
- Similarity and other spectral relations for symmetric cones
- Lectures on Modern Convex Optimization
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Interior Point Trajectories in Semidefinite Programming
- 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
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
