A dynamic inequality generation scheme for polynomial programming
- 4 March 2015
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 156 (1-2) , 21-57
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Exploiting special structure in semidefinite programming: A survey of theory and applicationsEuropean Journal of Operational Research, 2010
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problemMathematical Programming, 2008
- Recognizing underlying sparsity in optimizationMathematical Programming, 2008
- Exploiting equalities in polynomial programmingOperations Research Letters, 2008
- The quadratic knapsack problem—a surveyDiscrete Applied Mathematics, 2007
- Semidefinite representations for finite varietiesMathematical Programming, 2006
- Minimizing Polynomials via Sum of Squares over the Gradient IdealMathematical Programming, 2005
- Symmetry groups, semidefinite programs, and sums of squaresJournal of Pure and Applied Algebra, 2004
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Class of global minimum bounds of polynomial functionsCybernetics and Systems Analysis, 1988