Convexity and global optimization: a theoretical link

  • Authors:

  • A. Quilliot

  • Affiliations:

  • Univ. Blaise Pascal, Aubiere, France

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2001

Quantified Score

Hi-index 5.23

Visualization

Abstract

Here we propose a characterization of the subsets of Rn which are the sets of local optima of the restriction of some convex function to some discrete subset, and we prove that, under some conditions, recognizing these subsets can be done in polynomial time. We discuss eventual applications of these results to global optimization problems.