Rounding on the standard simplex: Regular grids for global optimization

Immanuel M. Bomze*, Stefan Gollowitzer, E. Alper Yıldırım

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Given a point on the standard simplex, we calculate a proximal point on the regular grid which is closest with respect to any norm in a large class, including all l p -norms for p ≥ 1. We show that the minimal l p -distance to the regular grid on the standard simplex can exceed one, even for very fine mesh sizes in high dimensions. Furthermore, for p = 1, the maximum minimal distance approaches the l 1 -diameter of the standard simplex. We also put our results into perspective with respect to the literature on approximating global optimization problems over the standard simplex by means of the regular grid.

Original languageEnglish
Pages (from-to)243-258
Number of pages16
JournalJournal of Global Optimization
Volume59
Issue number2-3
Early online date17 Dec 2013
DOIs
Publication statusPublished - 1 Jul 2014

Keywords

  • Approximation
  • Maximin distance
  • Proximal point
  • Regular grid
  • Rounding

Fingerprint

Dive into the research topics of 'Rounding on the standard simplex: Regular grids for global optimization'. Together they form a unique fingerprint.

Cite this