Abstract Convexity and Global Optimization
(Sprache: Englisch)
Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized...
Leider schon ausverkauft
versandkostenfrei
Buch
213.99 €
Produktdetails
Produktinformationen zu „Abstract Convexity and Global Optimization “
Klappentext zu „Abstract Convexity and Global Optimization “
Special tools are required for examining and solving optimization problems. The main tools in the study of local optimization are classical calculus and its modern generalizions which form nonsmooth analysis. The gradient and various kinds of generalized derivatives allow us to ac complish a local approximation of a given function in a neighbourhood of a given point. This kind of approximation is very useful in the study of local extrema. However, local approximation alone cannot help to solve many problems of global optimization, so there is a clear need to develop special global tools for solving these problems. The simplest and most well-known area of global and simultaneously local optimization is convex programming. The fundamental tool in the study of convex optimization problems is the subgradient, which actu ally plays both a local and global role. First, a subgradient of a convex function f at a point x carries out a local approximation of f in a neigh bourhood of x. Second, the subgradient permits the construction of an affine function, which does not exceed f over the entire space and coincides with f at x. This affine function h is called a support func tion. Since f(y) ~ h(y) for ally, the second role is global. In contrast to a local approximation, the function h will be called a global affine support.
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.
Inhaltsverzeichnis zu „Abstract Convexity and Global Optimization “
- Preface- Acknowledgment
1. An Introduction to Abstract Convexity
2. Elements of Monotonic Analysis: IPH Functions and Normal Sets
3. Elements of Monotonic Analysis: Monotonic Functions
4. Application to Global Optimization: Lagrange and Penalty Functions
5. Elements of Star-Shaped Analysis
6. Supremal Generators and Their Applications
7. Further Abstract Convexity
8. Application to Global Optimization: Duality
9. Application to Global Optimization: Numerical Methods
- References
- Index
Bibliographische Angaben
- Autor: Alexander M. Rubinov
- 2000, 516 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer US
- ISBN-10: 079236323X
- ISBN-13: 9780792363231
- Erscheinungsdatum: 31.05.2000
Sprache:
Englisch
Rezension zu „Abstract Convexity and Global Optimization “
'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)
Kommentar zu "Abstract Convexity and Global Optimization"
0 Gebrauchte Artikel zu „Abstract Convexity and Global Optimization“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Abstract Convexity and Global Optimization".
Kommentar verfassen