Diagonally Extended Univariate Algorithms for Multidimensional Global Optimization

  • János D. Pintér
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 6)

Abstract

In Part 2, a general framework was provided for analysing and constructing adaptive partition algorithms Specific instances of the generic partition algorithm scheme (PAS, as introduced in Section 2.1.2) can be applied to solve a broad class of global optimization problems with continuous or Lipschitz-continuous structure. The case of one- and multidimensional intervals and simplices, and more general convex, star and Lipschitzian feasible sets was discussed in detail.

Keywords

Search Point Global Optimization Problem Implementation Aspect Theoretical Convergence Decomposable Operator 
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 1996

Authors and Affiliations

  • János D. Pintér
    • 1
  1. 1.Pintér Consulting ServicesDalhousie UniversityCanada

Personalised recommendations