Partition Methods on General Convex and Star Sets

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


In this chapter we shall investigate the global optimization problem, specialized as
$$\mathop {\min }\limits_{x \in D} f(x),wheref \in F(D) = \mathop U\limits_{L >D} {F_L}(D)$$
In (2.6.1), D n is a robust, bounded and convex subset of the real n-space, and the Lipschitzian objective function f: D 1 is (possibly) multiextremal on the set D. Observe that this problem is significantly more general than the case of interval or simplex feasible regions studied in previous chapters of Part 2: consequently, it is not obvious how a PAS type strategy could be directly realized for solving (2.6.1).


General Convex Global Optimization Problem Nonlinear Constraint Partition Method Partition Strategy 
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.


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