Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- 17 September 2010
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 125 (2) , 353-383
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- The complexity of optimizing over a simplex, hypercube or sphere: a short surveyCentral European Journal of Operations Research, 2007
- Eigenvalues of a real supersymmetric tensorJournal of Symbolic Computation, 2005
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Blind constant modulus equalization via convex optimizationIEEE Transactions on Signal Processing, 2003
- Penalized maximum-likelihood estimation, the Baum–Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic dataJournal of Computational and Applied Mathematics, 2000
- Quadratic maximization and semidefinite relaxationMathematical Programming, 2000
- On maximization of quadratic form over intersection of ellipsoids with common centerMathematical Programming, 1999
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3Optimization Methods and Software, 1999
- Semidefinite relaxation and nonconvex quadratic optimizationOptimization Methods and Software, 1998