Global Quadratic Optimization on the Sets with Simplex Structure.

In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved with a constant relative accuracy. In the second part we consider some natural extensions of the result.

MoreLess

Year of publication:	1999
Authors:	Nesterov, Y.
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	OPTIMIZATION \| MATHEMATICAL ANALYSIS

More details

Series:	Papers.
Type of publication:	Book / Working Paper
Notes:	15 pages
Classification:	C60 - Mathematical Methods and Programming. General ; C00 - Mathematical and Quantitative Methods. General
Source:	RePEc - Research Papers in Economics

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