Journal of Global Optimization

, Volume 59, Issue 2–3, pp 243–258 | Cite as

Rounding on the standard simplex: regular grids for global optimization

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


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.


Rounding 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).


  1. 1.
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)CrossRefGoogle Scholar
  2. 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
  3. 3.
    Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Glob. Optim. 24, 163–185 (2002)CrossRefGoogle Scholar
  4. 4.
    Casado, L.G., García, I., Tóth, B.G., Hendrix, E.M.: On determining the cover of a simplex by spheres centered at its vertices. J. Global Optim. 50, 645–655 (2011)CrossRefGoogle Scholar
  5. 5.
    Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, É.: Sensitivity theorems in integer linear programming. Math. Program. 34, 251–264 (1986)CrossRefGoogle Scholar
  6. 6.
    de Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. Cent. Eur. J. Oper. Res. 16, 111–125 (2008)CrossRefGoogle Scholar
  7. 7.
    de Klerk, E.: D. den Hertog, and G. Elabwabi: On the complexity of optimization over the standard simplex. Eur. J. Oper. Res. 191, 773–785 (2008)CrossRefGoogle Scholar
  8. 8.
    de Klerk, E., Laurent, M., Parrilo, P.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comp. Sci. 361, 210–225 (2006)CrossRefGoogle Scholar
  9. 9.
    Evtushenko, Y.: Numerical methods for finding global extreme (case of a non-uniform mesh). USSR Comput. Math. Math. Phys. 11, 38–54 (1971)CrossRefGoogle Scholar
  10. 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
  11. 11.
    Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)CrossRefGoogle Scholar
  12. 12.
    Li, Z., He, S., Zhang, S.: Approximation methods for polynomial optimization: Models, algorithms and applications. Springer Briefs in Optimization, New York (2012)CrossRefGoogle Scholar
  13. 13.
    Nemirovsky, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. Wiley-Interscience, New York (1983)Google Scholar
  14. 14.
    Paulavičius, R., Žilinskas, J.: Simplicial Global Optimization. Springer, New York (2013)Google Scholar
  15. 15.
    Raber, U.: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J. Glob. Optim. 13, 417–432 (1998)CrossRefGoogle Scholar
  16. 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. 17.
    Sukharev, A.G.: Minimax Algorithms in Problems of Numerical Analysis (in Russian). Nauka, Moscow (1989)Google Scholar
  18. 18.
    Traub, J.F., Wasilkowski, G.W., Wozniakowski, H.: Infomation-Based Complexity. Academic Press, New York (1988)Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Immanuel M. Bomze
    • 1
  • Stefan Gollowitzer
    • 1
  • E. Alper Yıldırım
    • 2
  1. 1. Department of Statistics and Operations ResearchUniversity of ViennaViennaAustria
  2. 2. Department of Industrial Engineering Koç UniversityIstanbulTurkey

Personalised recommendations