Skip to main content
Top

2020 | OriginalPaper | Chapter

Toward Global Search for Local Optima

Authors : Jens Deussen, Jonathan Hüser, Uwe Naumann

Published in: Operations Research Proceedings 2019

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

First steps toward a novel deterministic algorithm for finding a minimum among all local minima of a nonconvex objective over a given domain are discussed. Nonsmooth convex relaxations of the objective and of its gradient are optimized in the context of a global branch and bound method. While preliminary numerical results look promising further effort is required to fully integrate the method into a robust and computationally efficient software solution.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Beckers, M., Mosenkis, V., Naumann, U.: Adjoint mode computation of subgradients for McCormick relaxations. In: Recent Advances in Algorithmic Differentiation, Springer, Berlin (2012) Beckers, M., Mosenkis, V., Naumann, U.: Adjoint mode computation of subgradients for McCormick relaxations. In: Recent Advances in Algorithmic Differentiation, Springer, Berlin (2012)
2.
go back to reference Deussen, J., Naumann, U.: Discrete Interval Adjoints in Unconstrained Global Optimization. In: Le Thi H., Le H., Pham Dinh T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol 991. Springer, Cham (2020) Deussen, J., Naumann, U.: Discrete Interval Adjoints in Unconstrained Global Optimization. In: Le Thi H., Le H., Pham Dinh T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol 991. Springer, Cham (2020)
3.
go back to reference Griewank, A.: On stable piecewise linearization and generalized algorithmic differentiation. Optim. Methods Softw. 28(6), 1139–1178 (2013)CrossRef Griewank, A.: On stable piecewise linearization and generalized algorithmic differentiation. Optim. Methods Softw. 28(6), 1139–1178 (2013)CrossRef
4.
go back to reference Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, 2nd edn. SIAM, Philadelphia (2008)CrossRef Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, 2nd edn. SIAM, Philadelphia (2008)CrossRef
5.
go back to reference Griewank, A., Walther, A.: Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization. SIAM J. Optim. 29(1), 262–289 (2019) Griewank, A., Walther, A.: Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization. SIAM J. Optim. 29(1), 262–289 (2019)
6.
go back to reference Griewank, A., Walther, A., Fiege, S., Bosse, T.: On lipschitz optimization based on gray-box piecewise linearization. Math. Program. 158(1–2), 383–415 (2016) Griewank, A., Walther, A., Fiege, S., Bosse, T.: On lipschitz optimization based on gray-box piecewise linearization. Math. Program. 158(1–2), 383–415 (2016)
7.
go back to reference Hansen, E., Walster, G.W.: Global Optimization using Interval Analysis. Marcel Dekker, New York (2004) Hansen, E., Walster, G.W.: Global Optimization using Interval Analysis. Marcel Dekker, New York (2004)
8.
go back to reference Jamil, M., Yang, X.: A literature survey of benchmark functions for global optimization problems. Int. J. Math. Model. Numer. Optim. 4(2), 150–194 (2013) Jamil, M., Yang, X.: A literature survey of benchmark functions for global optimization problems. Int. J. Math. Model. Numer. Optim. 4(2), 150–194 (2013)
9.
go back to reference Lotz, J., Leppkes, K., Naumann, U.: dco/c++: Derivative Code by Overloading in C++. Aachener Informatik Berichte (AIB-2011-06) (2011) Lotz, J., Leppkes, K., Naumann, U.: dco/c++: Derivative Code by Overloading in C++. Aachener Informatik Berichte (AIB-2011-06) (2011)
10.
go back to reference Mifflin, R.: A quasi-second-order proximal bundle algorithm. Math. Program. 73(1), 51–72 (1996)CrossRef Mifflin, R.: A quasi-second-order proximal bundle algorithm. Math. Program. 73(1), 51–72 (1996)CrossRef
11.
go back to reference Mitsos, A., Chachuat, B., Barton, P.: McCormick-based relaxation of algorithms. SIAM J. Optim. 20(2), 573–601 (2009)CrossRef Mitsos, A., Chachuat, B., Barton, P.: McCormick-based relaxation of algorithms. SIAM J. Optim. 20(2), 573–601 (2009)CrossRef
Metadata
Title
Toward Global Search for Local Optima
Authors
Jens Deussen
Jonathan Hüser
Uwe Naumann
Copyright Year
2020
DOI
https://doi.org/10.1007/978-3-030-48439-2_12

Premium Partner