This book aims at an innovative approach within the framework of convex analysis and optimization, based on an in-depth study of the behavior and properties of the supremum of families of convex functions. It presents an original and systematic treatment of convex analysis, covering standard results and improved calculus rules in subdifferential analysis. The tools supplied in the text allow a direct approach to the mathematical foundations of convex optimization, in particular to optimality and duality theory. Other applications in the book concern convexification processes in optimization, non-convex integration of the Fenchel subdifferential, variational characterizations of convexity, and the study of Chebychev sets. At the same time, the underlying geometrical meaning of all the involved concepts and operations is highlighted and duly emphasized. A notable feature of the book is its unifying methodology, as well as the novelty of providing an alternative or complementary viewto the traditional one in which the discipline is presented to students and researchers. 

This textbook can be used for courses on optimization, convex and variational analysis, addressed to graduate and post-graduate students of mathematics, and also students of economics and engineering. It is also oriented to provide specific background for courses on optimal control, data science, operations research, economics (game theory), etc. The book represents a challenging and motivating development for those experts in functional analysis, convex geometry, and any kind of researchers who may be interested in applications of their work.