Advertisement

Journal of Global Optimization

, Volume 72, Issue 2, pp 241–254 | Cite as

Exploiting algebraic structure in global optimization and the Belgian chocolate problem

  • Zachary Charles
  • Nigel Boston
Article
  • 115 Downloads

Abstract

The Belgian chocolate problem involves maximizing a parameter \(\delta \) over a non-convex region of polynomials. In this paper we detail a global optimization method for this problem that outperforms previous such methods by exploiting underlying algebraic structure. Previous work has focused on iterative methods that, due to the complicated non-convex feasible region, may require many iterations or result in non-optimal \(\delta \). By contrast, our method locates the largest known value of \(\delta \) in a non-iterative manner. We do this by using the algebraic structure to go directly to large limiting values, reducing the problem to a simpler combinatorial optimization problem. While these limiting values are not necessarily feasible, we give an explicit algorithm for arbitrarily approximating them by feasible \(\delta \). Using this approach, we find the largest known value of \(\delta \) to date, \(\delta = 0.9808348\). We also demonstrate that in low degree settings, our method recovers previously known upper bounds on \(\delta \) and that prior methods converge towards the \(\delta \) we find.

Keywords

Global optimization Control theory Belgian chocolate problem Stability Simultaneous stabilization 

Notes

Acknowledgements

The authors would like to thank Bob Barmish for his valuable feedback, discussions, and advice. Zachary Charles was partially supported by the National Science Foundation Grant DMS-1502553. Nigel Boston was partially supported by the Simons Foundation Grant MSN179747.

References

  1. 1.
    Asner Jr., B.A.: On the total nonnegativity of the Hurwitz matrix. SIAM J. Appl. Math. 18(2), 407–414 (1970)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bergweiler, W., Eremenko, A.: Gol’dberg’s constants. J. Anal. Math. 119(1), 365–402 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Blondel, V.: Simultaneous Stabilization of Linear Systems. Lecture Notes in Control and Information Sciences. Springer, Berlin (1994)Google Scholar
  4. 4.
    Boston, N.: On the Belgian chocolate problem and output feedback stabilization: efficacy of algebraic methods. In: Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on, pp. 869–870. IEEE (2012)Google Scholar
  5. 5.
    Burke, J.V., Henrion, D., Lewis, A.S., Overton, M.L.: Analysis of a Belgian Chocolate Stabilization Problem. LAAS-CNRS Research Report 5164 (2005)Google Scholar
  6. 6.
    Chang, Y., Sahinidis, N.V.: Global optimization in stabilizing controller design. J. Glob. Optim. 38(4), 509–526 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Guannan, H., Long, W., Bican, X., Wensheng, Y.: Stabilization of the Belgian chocolate system via low-order controllers. In: Control Conference, 2007. CCC 2007. Chinese, pp. 88–92. IEEE (2007)Google Scholar
  8. 8.
    Patel, V.V., Deodhare, G., Viswanath, T.: Some applications of randomized algorithms for control system design. Automatica 38(12), 2085–2092 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8(2), 107–138 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Verschelde, J.: Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. (TOMS) 25(2), 251–276 (1999)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringUniversity of Wisconsin-MadisonMadisonUSA
  2. 2.Department of MathematicsUniversity of Wisconsin-MadisonMadisonUSA

Personalised recommendations