Abstract convexity and global optimization (Q5941849)

Some generalizations of the convex subdifferential are based on abstract convexity, that is, on the representation of a function of a rather complicated nature as the upper envelope of a set of fairly simple functions. The subject matter of this book is concerned with abstract convexity and its relation to global optimization. In Chapter 1 some definitions related to abstract convexity are introduced. In Chapter 2-6 the main objects of this theory are described for some concrete sets of elementary functions. In Chapter 7 abstract convexity are examined in a general situation. In Chapters 8 and 9 both theoretical and numerical aspects of global optimization based on abstract convexity are studied. Some numerical methods, in particular versions of the cutting angle method, branch-and-bound methods and a method for monotonic optimization are described and results of numerical experiments are given. The book is of interest to specialists in global optimization, mathematical programming, convex analysis, as well as engineers using mathematical tools and optimization techniques.