Sparse noncommutative polynomial optimization
- 28 January 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 193 (2), 789-829
- https://doi.org/10.1007/s10107-020-01610-1
Abstract
No abstract availableKeywords
Funding Information
- Javna Agencija za Raziskovalno Dejavnost RS (J1-2453, P1-0222)
- Javna Agencija za Raziskovalno Dejavnost RS (J1-8155, N1-0057)
- Javna Agencija za Raziskovalno Dejavnost RS (N1-0071)
- Fondation Mathématique Jacques Hadamard (PGMO (EPICS project))
- Agence Nationale de la Recherche (Tremplin ERC Stg Grant ANR-18-ERC2-0004-01 (T-COPS project))
This publication has 55 references indexed in Scilit:
- The tracial moment problem and trace-optimization of polynomialsMathematical Programming, 2011
- Quantum bounds on Bell inequalitiesPhysical Review A, 2009
- Algorithm 883ACM Transactions on Mathematical Software, 2008
- Matrix Completion ProblemsPublished by Springer Science and Business Media LLC ,2008
- Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical resultsMathematical Programming, 2003
- Solving semidefinite-quadratic-linear programs using SDPT3Mathematical Programming, 2003
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Symmetries of some reduced free product C*-algebrasPublished by Springer Science and Business Media LLC ,1985
- Ordered linear spacesPublished by Springer Science and Business Media LLC ,1970
- Differential equations, difference equations and matrix theoryCommunications on Pure and Applied Mathematics, 1958