Rounding on the standard simplex: regular grids for global optimization
- 278 Downloads
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\)-norms for \(p\ge 1\). We show that the minimal \(\ell ^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 \(\ell ^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.
KeywordsRounding Regular grid Approximation Maximin distance Proximal point
The authors are grateful to two anonymous referees who pointed out additional related references, as well as to Oliver Stein for valuable remarks. E. Alper Yıldırım was supported in part by Turkish Scientific and Technological Research Council (TÜBİTAK) Grant 112M870 and by TÜBA-GEBİP (Turkish Academy of Sciences Young Scientists Award Program).
- 2.Bomze, I.M., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of combinatorial Optimization (supp. Vol. A), pp. 1–74. Kluwer, Dordrecht (1999)Google Scholar
- 10.Faybusovich, L.: Global optimization of homogeneous polynomials on the simplex and on the sphere. In: Floudas, C., Pardalos, P. (eds.) Frontiers in global optimization, pp. 109–121. Kluwer, Dordrecht (2003)Google Scholar
- 13.Nemirovsky, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. Wiley-Interscience, New York (1983)Google Scholar
- 14.Paulavičius, R., Žilinskas, J.: Simplicial Global Optimization. Springer, New York (2013)Google Scholar
- 16.Sergeyev, Y.D., Kvasov, D.E.: Lipschitz global optimization. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, New York (2010)Google Scholar
- 17.Sukharev, A.G.: Minimax Algorithms in Problems of Numerical Analysis (in Russian). Nauka, Moscow (1989)Google Scholar
- 18.Traub, J.F., Wasilkowski, G.W., Wozniakowski, H.: Infomation-Based Complexity. Academic Press, New York (1988)Google Scholar