The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Etienne de Klerk
Year of publication: |
2008
|
---|---|
Authors: | Klerk, Etienne de |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 11788756. - Vol. 16.2008, 2, p. 111-125
|
Saved in:
Saved in favorites
Similar items by person
-
Exploiting special structure in semidefinite programming: A survey of theory and applications
Klerk, Etienne de, (2010)
-
On convex quadratic approximation
Hertog, Dirk den, (2000)
-
Solving SDP's in non-commutative algebras part I : the dual-scaling algorithm
Klerk, Etienne de, (2005)
- More ...