The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Open Access
- 18 December 2007
- journal article
- Published by Springer Science and Business Media LLC in Central European Journal of Operations Research
- Vol. 16 (2), 111-125
- https://doi.org/10.1007/s10100-007-0052-9
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On the copositive representation of binary and continuous nonconvex quadratic programsMathematical Programming, 2008
- Integration and Optimization of Multivariate Polynomials by Restriction onto a Random SubspaceFoundations of Computational Mathematics, 2006
- Global Optimization of Homogeneous Polynomials on the Simplex and on the SpherePublished by Springer Science and Business Media LLC ,2004
- Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different AspectsSiam Review, 2002
- Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive ProgrammingJournal of Global Optimization, 2002
- Some optimal inapproximability resultsJournal of the ACM, 2001
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980