Product Description

This book consists of two parts. Firstly, the main notions of abstract convexity and their applications in the study of some classes of functions and sets are presented. Secondly, both theoretical and numerical aspects of global optimization based on abstract convexity are examined. Most of the book does not require knowledge of advanced mathematics. Classical methods of nonconvex mathematical programming, being based on a local approximation, cannot be used to examine and solve many problems of global optimization, and so there is a clear need to develop special global tools for solving these problems. Some of these tools 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. Audience: The book will be of interest to specialists in global optimization, mathematical programming, and convex analysis, as well as engineers using mathematical tools and optimization techniques and specialists in mathematical modelling.

Product Details

• Amazon Sales Rank: #3598104 in Books
• Published on: 2000-05-31
• Original language: English
• Number of items: 1
• Binding: Hardcover
• 508 pages

Review
'This book, written by one of the leading contributors in the field, is an up-to-date and very valuable reference. It will be precious to any researcher working in the field on theoretical aspects and applications as well. It opens new ways in global optimization.' Mathematical Reviews (2002i) 'The book will be very useful for experts in optimisation and aspects of functional and numerical analysis and related topics. This is an excellent introduction to those who are interested in the study of abstract convexity and its applications and to very interesting and highly applicable generalisations on convexity.' Australian Mathematical Society GAZETTE, August (2002)