The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey

We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as negative (inapproximability) results from the recent literature.

MoreLess

Year of publication:	2006
Authors:	de Klerk, Etienne
Institutions:	Tilburg University, Center for Economic Research
Subject:	computational complexity \| global optimization \| linear and semidefinite programming \| approximation algorithms

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2006-85
Classification:	C60 - Mathematical Methods and Programming. General
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011092404