The primary aim of this book is to present the conjugate and subdifferential calculus using the method of perturbation functions in order to obtain the most general results in this field. The secondary aim is to provide important applications of this calculus and of the properties of convex functions. Such applications are: the study of well-conditioned convex functions, uniformly convex and uniformly smooth convex functions, best approximation problems, characterizations of convexity, the study of the sets of weak sharp minima, well-behaved functions and the existence of global error bounds for convex inequalities, as well as the study of monotone multifunctions by using convex functions.

An insightful, concise, and rigorous treatment of the basic theory of convex sets and functions in finite dimensions, and the analytical/geometrical foundations of convex optimization and duality theory. Convexity theory is first developed in a simple accessible manner, using easily visualized proofs. Then the focus shifts to a transparent geometrical line of analysis to develop the fundamental duality between descriptions of convex functions in terms of points, and in terms of hyperplanes. Finally, convexity theory and abstract duality are applied to problems of constrained optimization, Fenchel and conic duality, and game theory to develop the sharpest possible duality results within a highly visual geometric framework. This on-line version of the book, includes an extensive set of theoretical problems with detailed high-quality solutions, which significantly extend the range and value of the book. The book may be used as a text for a theoretical convex optimization course; the author has taught several variants of such a course at MIT and elsewhere over the last ten years. It may also be used as a supplementary source for nonlinear programming classes, and as a theoretical foundation for classes focused on convex optimization models (rather than theory). It is an excellent supplement to several of our books: Convex Optimization Algorithms (Athena Scientific, 2015), Nonlinear Programming (Athena Scientific, 2017), Network Optimization(Athena Scientific, 1998), Introduction to Linear Optimization (Athena Scientific, 1997), and Network Flows and Monotropic Optimization (Athena Scientific, 1998).

This work is intended to serve as a guide for graduate students and researchers who wish to get acquainted with the main theoretical and practical tools for the numerical minimization of convex functions on Hilbert spaces. Therefore, it contains the main tools that are necessary to conduct independent research on the topic. It is also a concise, easy-to-follow and self-contained textbook, which may be useful for any researcher working on related fields, as well as teachers giving graduate-level courses on the topic. It will contain a thorough revision of the extant literature including both classical and state-of-the-art references.

This book investigates several duality approaches for vector optimization problems, while also comparing them. Special attention is paid to duality for linear vector optimization problems, for which a vector dual that avoids the shortcomings of the classical ones is proposed. Moreover, the book addresses different efficiency concepts for vector optimization problems. Among the problems that appear when the framework is generalized by considering set-valued functions, an increasing interest is generated by those involving monotone operators, especially now that new methods for approaching them by means of convex analysis have been developed. Following this path, the book provides several results on different properties of sums of monotone operators.

This book presents a unified theory of convex functions, sets, and set-valued mappings in topological vector spaces with its specifications to locally convex, Banach and finite-dimensional settings. These developments and expositions are based on the powerful geometric approach of variational analysis, which resides on set extremality with its characterizations and specifications in the presence of convexity. Using this approach, the text consolidates the device of fundamental facts of generalized differential calculus to obtain novel results for convex sets, functions, and set-valued mappings in finite and infinite dimensions. It also explores topics beyond convexity using the fundamental machinery of convex analysis to develop nonconvex generalized differentiation and its applications. The text utilizes an adaptable framework designed with researchers as well as multiple levels of students in mind. It includes many exercises and figures suited to graduate classes in mathematical sciences that are also accessible to advanced students in economics, engineering, and other applications. In addition, it includes chapters on convex analysis and optimization in finite-dimensional spaces that will be useful to upper undergraduate students, whereas the work as a whole provides an ample resource to mathematicians and applied scientists, particularly experts in convex and variational analysis, optimization, and their applications.

This book examines the most fundamental parts of convex analysis and its applications to optimization and location problems. Accessible techniques of variational analysis are employed to clarify and simplify some basic proofs in convex analysis and to build a theory of generalized differentiation for convex functions and sets in finite dimensions. The book serves as a bridge for the readers who have just started using convex analysis to reach deeper topics in the field. Detailed proofs are presented for most of the results in the book and also included are many figures and exercises for better understanding the material. Applications provided include both the classical topics of convex optimization and important problems of modern convex optimization, convex geometry, and facility location.

This book contains the latest advances in variational analysis and set / vector optimization, including uncertain optimization, optimal control and bilevel optimization. Recent developments concerning scalarization techniques, necessary and sufficient optimality conditions and duality statements are given. New numerical methods for efficiently solving set optimization problems are provided. Moreover, applications in economics, finance and risk theory are discussed. Summary The objective of this book is to present advances in different areas of variational analysis and set optimization, especially uncertain optimization, optimal control and bilevel optimization. Uncertain optimization problems will be approached from both a stochastic as well as a robust point of view. This leads to different interpretations of the solutions, which widens the choices for a decision-maker given his preferences. Recent developments regarding linear and nonlinear scalarization techniques with solid and nonsolid ordering cones for solving set optimization problems are discussed in this book. These results are useful for deriving optimality conditions for set and vector optimization problems. Consequently, necessary and sufficient optimality conditions are presented within this book, both in terms of scalarization as well as generalized derivatives. Moreover, an overview of existing duality statements and new duality assertions is given. The book also addresses the field of variable domination structures in vector and set optimization. Including variable ordering cones is especially important in applications such as medical image registration with uncertainties. This book covers a wide range of applications of set optimization. These range from finance, investment, insurance, control theory, economics to risk theory. As uncertain multi-objective optimization, especially robust approaches, lead to set optimization, one main focus of this book is uncertain optimization. Important recent developments concerning numerical methods for solving set optimization problems sufficiently fast are main features of this book. These are illustrated by various examples as well as easy-to-follow-steps in order to facilitate the decision process for users. Simple techniques aimed at practitioners working in the fields of mathematical programming, finance and portfolio selection are presented. These will help in the decision-making process, as well as give an overview of nondominated solutions to choose from.

"Fixed-Point Algorithms for Inverse Problems in Science and Engineering" presents some of the most recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. The material presented provides a survey of the state-of-the-art theory and practice in fixed-point algorithms, identifying emerging problems driven by applications, and discussing new approaches for solving these problems. This book incorporates diverse perspectives from broad-ranging areas of research including, variational analysis, numerical linear algebra, biotechnology, materials science, computational solid-state physics, and chemistry. Topics presented include: Theory of Fixed-point algorithms: convex analysis, convex optimization, subdifferential calculus, nonsmooth analysis, proximal point methods, projection methods, resolvent and related fixed-point theoretic methods, and monotone operator theory. Numerical analysis of fixed-point algorithms: choice of step lengths, of weights, of blocks for block-iterative and parallel methods, and of relaxation parameters; regularization of ill-posed problems; numerical comparison of various methods. Areas of Applications: engineering (image and signal reconstruction and decompression problems), computer tomography and radiation treatment planning (convex feasibility problems), astronomy (adaptive optics), crystallography (molecular structure reconstruction), computational chemistry (molecular structure simulation) and other areas. Because of the variety of applications presented, this book can easily serve as a basis for new and innovated research and collaboration.

This book’s title, Nonsmooth Mechanics and Analysis, refers to a major domain of mechanics, particularly those initiated by the works of Jean Jacques Moreau. Nonsmooth mechanics concerns mechanical situations with possible nondifferentiable relationships, eventually discontinuous, as unilateral contact, dry friction, collisions, plasticity, damage, and phase transition. The basis of the approach consists in dealing with such problems without resorting to any regularization process. Indeed, the nonsmoothness is due to simplified mechanical modeling; a more sophisticated model would require too large a number of variables, and sometimes the mechanical information is not available via experimental investigations. Therefore, the mathematical formulation becomes nonsmooth; regularizing would only be a trick of arithmetic without any physical justification. Nonsmooth analysis was developed, especially in Montpellier, to provide specific theoretical and numerical tools to deal with nonsmoothness. It is important not only in mechanics but also in physics, robotics, and economics. Audience This book is intended for researchers in mathematics and mechanics.