Spectrahedral cones generated by rank \(1\) matrices
Publication:5964246
DOI10.1007/s10898-015-0313-4zbMath1335.15038arXiv1409.4781OpenAlexW2112086696MaRDI QIDQ5964246
Publication date: 29 February 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.4781
complex matricesexactnesspositive semi-definite matricesquadratically constrained quadratic optimization problemquaternionic matricesrank \(1\) extreme raysemi-definite relaxationspectrahedral cones
Semidefinite programming (90C22) Quadratic programming (90C20) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a quaternionic analogue of the cross-ratio
- Positive semidefinite matrices with a given sparsity pattern
- Schur products and matrix completions
- Characterization of the barrier parameter of homogeneous convex cones
- On the sparsity order of a graph and its deficiency in chordality
- Extrémales du cône des matrices de type non négatif, à coefficients positifs ou nuls
- Some geometric results in semidefinite programming
- Matrices of quaternions
- On the Field of Values of a Matrix
- Linear matrix inequality representation of sets
- Matrix Generalizations of a Moment Problem Theorem I. The Hermitian Case
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
- On linear combinations of quadratic forms
This page was built for publication: Spectrahedral cones generated by rank \(1\) matrices
