The book includes selected contributions presented at the "International Meeting on Functional Analysis and Continuous Optimization" held in Elche (Spain) on June 16–17, 2022. Its contents cover very recent results in functional analysis, continuous optimization and the interplay between these disciplines. Therefore, this book showcases current research on functional analysis and optimization with individual contributions, as well as new developments in both areas. As a result, the reader will find useful information and stimulating ideas.

This book, Functional Analysis, is designed for absolute beginners who want to understand the fundamental ideas of functional analysis without advanced prerequisites. Starting from the basics, it introduces concepts like vector spaces, norms, and linear operators, using simple explanations and examples to build a strong foundation. Each chapter breaks down complex topics step-by-step, making it accessible for anyone new to the subject. By the end, readers will have a clear understanding of the core principles of functional analysis and how these ideas apply in mathematics, physics, and engineering.

Functional analysis owes much of its early impetus to problems that arise in the calculus of variations. In turn, the methods developed there have been applied to optimal control, an area that also requires new tools, such as nonsmooth analysis. This self-contained textbook gives a complete course on all these topics. It is written by a leading specialist who is also a noted expositor. This book provides a thorough introduction to functional analysis and includes many novel elements as well as the standard topics. A short course on nonsmooth analysis and geometry completes the first half of the book whilst the second half concerns the calculus of variations and optimal control. The author provides a comprehensive course on these subjects, from their inception through to the present. A notable feature is the inclusion of recent, unifying developments on regularity, multiplier rules, and the Pontryagin maximum principle, which appear here for the first time in a textbook. Other major themes include existence and Hamilton-Jacobi methods. The many substantial examples, and the more than three hundred exercises, treat such topics as viscosity solutions, nonsmooth Lagrangians, the logarithmic Sobolev inequality, periodic trajectories, and systems theory. They also touch lightly upon several fields of application: mechanics, economics, resources, finance, control engineering. Functional Analysis, Calculus of Variations and Optimal Control is intended to support several different courses at the first-year or second-year graduate level, on functional analysis, on the calculus of variations and optimal control, or on some combination. For this reason, it has been organized with customization in mind. The text also has considerable value as a reference. Besides its advanced results in the calculus of variations and optimal control, its polished presentation of certain other topics (for example convex analysis, measurable selections, metric regularity, and nonsmooth analysis) will be appreciated by researchers in these and related fields.

Memetic Algorithms (MAs) are computational intelligence structures combining multiple and various operators in order to address optimization problems. The combination and interaction amongst operators evolves and promotes the diffusion of the most successful units and generates an algorithmic behavior which can handle complex objective functions and hard fitness landscapes. “Handbook of Memetic Algorithms” organizes, in a structured way, all the the most important results in the field of MAs since their earliest definition until now. A broad review including various algorithmic solutions as well as successful applications is included in this book. Each class of optimization problems, such as constrained optimization, multi-objective optimization, continuous vs combinatorial problems, uncertainties, are analysed separately and, for each problem, memetic recipes for tackling the difficulties are given with some successful examples. Although this book contains chapters written by multiple authors, a great attention has been given by the editors to make it a compact and smooth work which covers all the main areas of computational intelligence optimization. It is not only a necessary read for researchers working in the research area, but also a useful handbook for practitioners and engineers who need to address real-world optimization problems. In addition, the book structure makes it an interesting work also for graduate students and researchers is related fields of mathematics and computer science.

This book has evolved from my experience over the past decade in teaching and doing research in functional analysis and certain of its appli cations. These applications are to optimization theory in general and to best approximation theory in particular. The geometric nature of the subjects has greatly influenced the approach to functional analysis presented herein, especially its basis on the unifying concept of convexity. Most of the major theorems either concern or depend on properties of convex sets; the others generally pertain to conjugate spaces or compactness properties, both of which topics are important for the proper setting and resolution of optimization problems. In consequence, and in contrast to most other treatments of functional analysis, there is no discussion of spectral theory, and only the most basic and general properties of linear operators are established. Some of the theoretical highlights of the book are the Banach space theorems associated with the names of Dixmier, Krein, James, Smulian, Bishop-Phelps, Brondsted-Rockafellar, and Bessaga-Pelczynski. Prior to these (and others) we establish to two most important principles of geometric functional analysis: the extended Krein-Milman theorem and the Hahn Banach principle, the latter appearing in ten different but equivalent formula tions (some of which are optimality criteria for convex programs). In addition, a good deal of attention is paid to properties and characterizations of conjugate spaces, especially reflexive spaces.

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.

This book brings together papers presented at the 2016 International Conference on Communications, Signal Processing, and Systems, which provides a venue to disseminate the latest developments and to discuss the interactions and links between these multidisciplinary fields. Spanning topics ranging from communications to signal processing and systems, this book is aimed at undergraduate and graduate students in electrical engineering, computer science and mathematics, researchers and engineers from academia and industry as well as government employees (such as NSF, DOD and DOE).

The conference took place in Lviv, Ukraine and was dedicated to a famous Polish mathematician Stefan Banach ƒ{ the most outstanding representative of the Lviv mathematical school. Banach spaces, introduced by Stefan Banach at the beginning of twentieth century, are familiar now to every mathematician. The book contains a short historical article and scientific contributions of the conference participants, mostly in the areas of functional analysis, general topology, operator theory and related topics.

Functional analysis arose from traditional topics of calculus and integral and differential equations. This accessible text by an internationally renowned teacher and author starts with problems in numerical analysis and shows how they lead naturally to the concepts of functional analysis. Suitable for advanced undergraduates and graduate students, this book provides coherent explanations for complex concepts. Topics include Banach and Hilbert spaces, contraction mappings and other criteria for convergence, differentiation and integration in Banach spaces, the Kantorovich test for convergence of an iteration, and Rall's ideas of polynomial and quadratic operators. Numerous examples appear throughout the text.