The \(Q\) method for symmetric cone programming
From MaRDI portal
Publication:639204
DOI10.1007/s10957-010-9777-zzbMath1221.90071MaRDI QIDQ639204
Publication date: 18 September 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9777-z
Newton's method; Jordan algebras; complementarity; polar decomposition; symmetric cone programming; ``warm-starting algorithm; infeasible interior point method
90C22: Semidefinite programming
Related Items
Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, A new infeasible-interior-point algorithm for linear programming over symmetric cones, The \(Q\) method for second order cone programming, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior path following primal-dual algorithms. I: Linear programming
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- 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
- Second-order cone programming
- A Newton's method for perturbed second-order cone programs
- The \(Q\) method for second order cone programming
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Barrier Functions in Interior Point Methods
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision
