Global quadratic optimization on the sets with simplex structure

Nesterov, Yurii
(1999)

Files

dp9915.pdf
  • Open Access
  • Adobe PDF
  • 122.49 KB
Download

Details

Authors
  • Nesterov, YuriiUCLouvain
    Author
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Nesterov, Y. (1999). Global quadratic optimization on the sets with simplex structure (CORE Discussion Papers 1999/15). https://hdl.handle.net/2078.5/64183