Rounding on the standard simplex: regular grids for global optimization
Stefan Gollowitzer () and
E. Yıldırım ()
Journal of Global Optimization, 2014, vol. 59, issue 2, 243-258
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 $$\ell ^p$$ ℓ p -norms for $$p\ge 1$$ p ≥ 1 . We show that the minimal $$\ell ^p$$ ℓ 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$$ p = 1 , the maximum minimal distance approaches the $$\ell ^1$$ ℓ 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. Copyright Springer Science+Business Media New York 2014
Keywords: Rounding; Regular grid; Approximation; Maximin distance; Proximal point (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:59:y:2014:i:2:p:243-258
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898
Access Statistics for this article
Journal of Global Optimization is currently edited by Sergiy Butenko
More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla ().