An Implementation of a Lipschitzian Global Optimization Procedure

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

Abstract

The general framework and underlying convergence theory of adaptive partition algorithms in global optimization leave ample room for constructing robust and effective, computationally viable algorithm-instances. The program system described below has been implemented (in gradually developed versions), extensively tested, and applied by this author in the past decade. This, of course, does not imply any notion of ‘perfection’—in fact, the program modules have often been (and surely will be) modified and improved, not infrequently in connection with new applications.

Keywords

Assure Editing 

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