Similarity and other spectral relations for symmetric cones

DOI10.1016/S0024-3795(00)00096-3zbMath0973.90093MaRDI QIDQ1573667

Jos F. Sturm

Publication date: 7 August 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

optimizationinterior point methodssymmetric coneeuclidean Jordan algebra

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Positive matrices and their generalizations; cones of matrices (15B48) Jordan algebras (algebras, triples and pairs) (17C99)

Related Items

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, Todd's maximum-volume ellipsoid problem on symmetric cones, A Lie product type formula in Euclidean Jordan algebras, A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs, Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, On certain order properties of non Kubo-Ando means in operator algebras, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, A bound on the Carathéodory number, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, Hilbert's projective metric on Lorentz cones and Birkhoff formula for Lorentzian compressions, Optimality conditions for nonlinear semidefinite programming via squared slack variables, A new corrector-predictor interior-point method for symmetric cone optimization, On a box-constrained linear symmetric cone optimization problem, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, Several Jordan-algebraic aspects of optimization†, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, A note on the Ostrowski-Schneider type inertia theorem in Euclidean Jordan algebras, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, An extension of Chubanov's algorithm to symmetric cones, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones, A new infeasible interior-point method based on Darvay's technique for symmetric optimization, A weighted-path-following method for symmetric cone linear complementarity problems, Amenable cones: error bounds without constraint qualifications, On preservers related to the spectral geometric mean, An infeasible full-NT step interior point algorithm for CQSCO, A polynomial primal-dual affine scaling algorithm for symmetric conic optimization, \(\varGamma \)-commuting triples of positive definite matrices and midpoint equations on unitary matrices, Lyapunov-type least-squares problems over symmetric cones, A corrector-predictor path-following method for convex quadratic symmetric cone optimization, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method, Unnamed Item, Unnamed Item, On a commutative class of search directions for linear programming over symmetric cones

Uses Software

• CSDP
• SeDuMi
• SDPT3
• SDPpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concavity of certain maps on positive definite matrices and applications to Hadamard products
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Characterization of the barrier parameter of homogeneous convex cones
• Polynomial primal-dual cone affine scaling for semidefinite programming
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Complementarity and nondegeneracy in semidefinite programming
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization
• Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
• Positivitatsbereiche Im R n
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• On the Nesterov--Todd Direction in Semidefinite Programming
• Barrier Functions in Interior Point Methods
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone 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 Jordan-algebraic approach to potential-reduction algorithms