Condition for Global Minimum Through Abstract Convexity PDF Download

Author: Evgeny Sharikov
Publisher: LAP Lambert Academic Publishing
ISBN: 9783838321059
Category :
Languages : en
Pages : 124

View

Book Description
Subdifferential calculus and separation theorems play a crucial role for applications of classical convex analysis to global optimization. More precisely, they allow the formulation of conditions (necessary or sufficient) for the global minimum of some convex optimization problems. The theory of abstract convexity generalizes ideas of convex analysis by using the notion of global supports and the global definition of subdifferential. In order to apply this theory to optimization, we need to extend subdifferential calculus and separation properties into the area of abstract convexity. This is the main objective of the present thesis. The work should be useful to professionals in generalized convexity and global optimization.

Author: E. V. Sharikov
Publisher:
ISBN:
Category : Functional analysis
Languages : en
Pages : 244

View

Book Description
"The theory of abstract convexity generalizes ideas of convex analysis by using the notion of global supports and the global definition of subdifferential. In order to apply this theory to optimization, we need to extend subdifferential calculus and separation properties into the area of abstract convexity." --Abstract.

Author: Alexander M. Rubinov
Publisher: Springer Science & Business Media
ISBN: 1475732007
Category : Mathematics
Languages : en
Pages : 506

View

Book Description
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.

Author: Alexander M. Rubinov
Publisher: Springer Science & Business Media
ISBN: 9780792363231
Category : Mathematics
Languages : en
Pages : 516

View

Book 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.

Author: Isaac Pesenson
Publisher: Birkhäuser
ISBN: 3319555502
Category : Mathematics
Languages : en
Pages : 437

View

Book Description
The first of a two volume set on novel methods in harmonic analysis, this book draws on a number of original research and survey papers from well-known specialists detailing the latest innovations and recently discovered links between various fields. Along with many deep theoretical results, these volumes contain numerous applications to problems in signal processing, medical imaging, geodesy, statistics, and data science. The chapters within cover an impressive range of ideas from both traditional and modern harmonic analysis, such as: the Fourier transform, Shannon sampling, frames, wavelets, functions on Euclidean spaces, analysis on function spaces of Riemannian and sub-Riemannian manifolds, Fourier analysis on manifolds and Lie groups, analysis on combinatorial graphs, sheaves, co-sheaves, and persistent homologies on topological spaces. Volume I is organized around the theme of frames and other bases in abstract and function spaces, covering topics such as: The advanced development of frames, including Sigma-Delta quantization for fusion frames, localization of frames, and frame conditioning, as well as applications to distributed sensor networks, Galerkin-like representation of operators, scaling on graphs, and dynamical sampling. A systematic approach to shearlets with applications to wavefront sets and function spaces. Prolate and generalized prolate functions, spherical Gauss-Laguerre basis functions, and radial basis functions. Kernel methods, wavelets, and frames on compact and non-compact manifolds.

Author: Alberto Cambini
Publisher:
ISBN:
Category : Convex functions
Languages : en
Pages : 416

View

Book Description
The aim of this volume is to strengthen the interest in generalized convexity, generalized monotonicity and related areas and to stimulate new research in these fields by update survey (or recent results) of known experts covering many important topics such as some new theoretical aspects of generalized convexity and generalized invexity, some applications of generalized monotonicity and pseudomonotonicity to equilibrium problems and to economic and financial problems, some applications of abstract convexity, some applications of discrete convex analysis to cooperative game theory, fractional programming, optimality conditions in vector optimization (smooth and non-smooth), semi-infinite optimization and a new method for solving multiobjective problems.

Author: Stephen P. Boyd
Publisher: Cambridge University Press
ISBN: 9780521833783
Category : Business & Economics
Languages : en
Pages : 744

View

Book Description
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.

Author: Jacob Ponstein
Publisher: Springer Science & Business Media
ISBN: 3642456103
Category : Business & Economics
Languages : en
Pages : 151

View

Book Description
The analysis and optimization of convex functions have re ceived a great deal of attention during the last two decades. If we had to choose two key-words from these developments, we would retain the concept of ~ubdi66~e~ and the duality theo~y. As it usual in the development of mathematical theories, people had since tried to extend the known defi nitions and properties to new classes of functions, including the convex ones. For what concerns the generalization of the notion of subdifferential, tremendous achievements have been carried out in the past decade and any rna·· thematician who is faced with a nondifferentiable nonconvex function has now a panoply of generalized subdifferentials or derivatives at his disposal. A lot remains to be done in this area, especially concerning vecto~-valued functions ; however we think the golden age for these researches is behind us. Duality theory has also fascinated many mathematicians since the underlying mathematical framework has been laid down in the context of Convex Analysis. The various duality schemes which have emerged in the re cent years, despite of their mathematical elegance, have not always proved as powerful as expected.

Author: Pierre Mereau
Publisher:
ISBN:
Category :
Languages : en
Pages : 9

View

Book Description
Several sufficient conditions for global constrained minima are given. These conditions consist of necessary conditions for local minima together with generalized convexity assumptions. The convexity-type assumptions are made on the Lagrangian function, which presents the advantage of not requiring any (generalized convexity) assumption on each function involved in the problem and of allowing probelms with several local extrema. Previously obtained results are used to replace pseudo-convexity by a more workable condition. (Author).

Author: Jean-Baptiste Hiriart-Urruty
Publisher: Springer Science & Business Media
ISBN: 3662027968
Category : Mathematics
Languages : en
Pages : 432

View

Book Description
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.