Advertisement

Global Optimization Methods as Bounding Procedures — The Geometric Approach

  • Roman G. Strongin
  • Yaroslav D. Sergeyev
Chapter
  • 479 Downloads
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 45)

Abstract

Let us consider again the Lipschitz-continuous function φ(x), x ∈ [a, b], from (1.2.6) and the corresponding minimization problem (2.1.1). As has already been mentioned in Chapter 1, this problem has been intensively studied by many authors. In this book, on a level with the information approach presented in the previous Chapters, we discuss the geometric approach for solving the problem (2.1.1). We pay great attention to the ideas of an adaptive estimation of the objective function behaviour introduced in Chapters 2, 3 and ways in which they may be applied to another class of algorithms.

Keywords

Global Minimizer Limit Point Iteration Number Auxiliary Function Lipschitz Constant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Roman G. Strongin
    • 1
  • Yaroslav D. Sergeyev
    • 1
    • 2
  1. 1.Nizhni Novgorod State UniversityNizhni NovgorodRussia
  2. 2.Institute of Systems Analysis and Information TechnologyUniversity of CalabriaRendeItaly

Personalised recommendations