Alexander J. Zaslavski - Böcker

This monograph is devoted to recent progress in the turnpike t- ory. Turnpike properties are well known in mathematical economics. The term was ?rst coined by Samuelson who showed that an e?cient expanding economy would for most of the time be in the vicinity of a balanced equilibrium path (also called a von Neumann path) [78, 79]. These properties were studied by many authors for optimal trajec- ries of a Neumann-Gale model determined by a superlinear set-valued mapping. In the monograph we discuss a number of results conce- ing turnpike properties in the calculus of variations and optimal control which were obtained by the author in the last ten years. These results showthattheturnpikepropertiesareageneralphenomenonwhichholds for various classes of variational problems and optimal control problems. Turnpike properties are studied for optimal control problems on- nite time intervals [T ,T ] of the real line. Solutions of such problems 1 2 (trajectories) always depend on the time interval [T ,T ], an optimality 1 2 criterion which is usually determined by a cost function, and on data which is some initial conditions.In the turnpike theory we are int- ested in the structure of solutions of optimal problems. We study the behavior of solutions when an optimality criterion is ?xed while T ,T 1 2 andthedatavary.

"Optimization on Metric and Normed Spaces" is devoted to the recent progress in optimization on Banach spaces and complete metric spaces.Optimization problems are usually considered on metric spaces satisfying certain compactness assumptions which guarantee the existence of solutions and convergence of algorithms. This book considers spaces that do not satisfy such compactness assumptions. In order to overcome these difficulties, the book uses the Baire category approach and considers approximate solutions. Therefore, it presents a number of new results concerning penalty methods in constrained optimization, existence of solutions in parametric optimization, well-posedness of vector minimization problems, and many other results obtained in the last ten years.The book is intended for mathematicians interested in optimization and applied functional analysis.

This monograph is devoted to recent progress in the turnpike t- ory. Turnpike properties are well known in mathematical economics. The term was ?rst coined by Samuelson who showed that an e?cient expanding economy would for most of the time be in the vicinity of a balanced equilibrium path (also called a von Neumann path) [78, 79]. These properties were studied by many authors for optimal trajec- ries of a Neumann-Gale model determined by a superlinear set-valued mapping. In the monograph we discuss a number of results conce- ing turnpike properties in the calculus of variations and optimal control which were obtained by the author in the last ten years. These results showthattheturnpikepropertiesareageneralphenomenonwhichholds for various classes of variational problems and optimal control problems. Turnpike properties are studied for optimal control problems on- nite time intervals [T ,T ] of the real line. Solutions of such problems 1 2 (trajectories) always depend on the time interval [T ,T ], an optimality 1 2 criterion which is usually determined by a cost function, and on data which is some initial conditions.In the turnpike theory we are int- ested in the structure of solutions of optimal problems. We study the behavior of solutions when an optimality criterion is ?xed while T ,T 1 2 andthedatavary.

"Optimization on Metric and Normed Spaces" is devoted to the recent progress in optimization on Banach spaces and complete metric spaces.Optimization problems are usually considered on metric spaces satisfying certain compactness assumptions which guarantee the existence of solutions and convergence of algorithms. This book considers spaces that do not satisfy such compactness assumptions. In order to overcome these difficulties, the book uses the Baire category approach and considers approximate solutions. Therefore, it presents a number of new results concerning penalty methods in constrained optimization, existence of solutions in parametric optimization, well-posedness of vector minimization problems, and many other results obtained in the last ten years.The book is intended for mathematicians interested in optimization and applied functional analysis.

​Structure of Solutions of Variational Problems is devoted to recent progress made in the studies of the structure of approximate solutions of variational problems considered on subintervals of a real line.  Results on properties of approximate solutions which are independent of the length of the interval, for all sufficiently large intervals are presented in a clear manner. Solutions, new approaches, techniques and methods to a number of difficult problems in the calculus of variations  are illustrated throughout this book. This book also contains significant results and information about the turnpike property of the variational problems. This well-known property is a general phenomenon which holds for large classes of variational problems. The author examines the following in relation to the turnpike property  in individual  (non-generic) turnpike results, sufficient and necessary conditions for the turnpike phenomenon as well as in the non-intersection property for extremals of variational problems. This book appeals to mathematicians  working in optimal control and the calculus as  well as with graduate students.​​​

Nonconvex Optimal Control and Variational Problems is an important contribution to the existing literature in the field and is devoted to the presentation of progress made in the last 15 years of research in the area of optimal control and the calculus of variations.

This book presents an extensive collection of state-of-the-art results and references in nonlinear functional analysis demonstrating how the generic approach proves to be very useful in solving many interesting and important problems.

Nonconvex Optimal Control and Variational Problems is an important contribution to the existing literature in the field and is devoted to the presentation of progress made in the last 15 years of research in the area of optimal control and the calculus of variations. This volume contains a number of results concerning well-posedness of optimal control and variational problems, nonoccurrence of the Lavrentiev phenomenon for optimal control and variational problems, and turnpike properties of approximate solutions of variational problems.Chapter 1 contains an introduction as well as examples of select topics. Chapters 2-5 consider the well-posedness condition using fine tools of general topology and porosity. Chapters 6-8 are devoted to the nonoccurrence of the Lavrentiev phenomenon and contain original results. Chapter 9 focuses on infinite-dimensional linear control problems, and Chapter 10 deals with “good” functions and explores new understandings on the questions of optimality and variational problems. Finally, Chapters 11-12 are centered around the turnpike property, a particular area of expertise for the author.This volume is intended for mathematicians, engineers, and scientists interested in the calculus of variations, optimal control, optimization, and applied functional analysis, as well as both undergraduate and graduate students specializing in those areas. The text devoted to Turnpike properties may be of particular interest to the economics community.

This book presents an extensive collection of state-of-the-art results and references in nonlinear functional analysis demonstrating how the generic approach proves to be very useful in solving many interesting and important problems. Nonlinear analysis plays an ever-increasing role in theoretical and applied mathematics, as well as in many other areas of science such as engineering, statistics, computer science, economics, finance, and medicine. The text may be used as supplementary material for graduate courses in nonlinear functional analysis, optimization theory and approximation theory, and is a treasure trove for instructors, researchers, and practitioners in mathematics and in the mathematical sciences.Each chapter is self-contained; proofs are solid and carefully communicated. Genericity in Nonlinear Analysis is the first book to systematically present the generic approach to nonlinear analysis. Topics presented include convergence analysis of powers and infinite products via the Baire Category Theorem, fixed point theory of both single- and set-valued mappings, best approximation problems, discrete and continuous descent methods for minimization in a general Banach space, and the structure of minimal energy configurations with rational numbers in the Aubry–Mather theory.

This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space.

This book provides a comprehensive study of turnpike phenomenon arising in optimal control theory. The focus is on individual (non-generic) turnpike results which are both mathematically significant and have numerous applications in engineering and economic theory. All results obtained in the book are new. New approaches, techniques, and methods are rigorously presented and utilize research from finite-dimensional variational problems and discrete-time optimal control problems to find the necessary conditions for the turnpike phenomenon in infinite dimensional spaces.  The semigroup approach is employed in the discussion as well as PDE descriptions of continuous-time dynamics. The main results on sufficient and necessary conditions for the turnpike property are completely proved and the numerous illustrative examples support the material for the broad spectrum of experts. Mathematicians interested in the calculus of variations, optimal control and in applied functional analysis will find this book a useful guide to the turnpike phenomenon in infinite dimensional spaces.  Experts in economic and engineering modeling as well as graduate students will also benefit from the developed techniques and obtained results.

This book provides a comprehensive study of turnpike phenomenon arising in optimal control theory.

This book is devoted to the study of optimal control problems arising in forest management, an important and fascinating topic in mathematical economics studied by many researchers over the years.

The book is devoted to the study of approximate solutions of optimization problems in the presence of computational errors. It contains a number of results on the convergence behavior of algorithms in a Hilbert space, which are known as important tools for solving optimization problems. The research presented in the book is the continuation and the further development of the author's (c) 2016 book Numerical Optimization with Computational Errors, Springer 2016. Both books study the algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to find out what an approximate solution can be obtained and how many iterates one needs for this. The main difference between this new book and the 2016 book is that in this present book the discussion takes into consideration the fact that for every algorithm, its iteration consists of several steps and that computational errors for different steps are generally, different. This fact, which was not taken into account in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we calculate a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are different in general. It may happen that the feasible set is simple and the objective function is complicated. As a result, the computational error, made when one calculates the projection, is essentially smaller than the computational error of the calculation of the subgradient. Clearly, an opposite case is possible too. Another feature of this book is a study of a number of important algorithms which appeared recently in the literature and which are not discussed in the previous book. This monograph contains 12 chapters. Chapter 1 is an introduction. In Chapter 2 we study the subgradient projection algorithm for minimization of convex and nonsmooth functions. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 3 we analyze the mirror descent algorithm for minimization of convex and nonsmooth functions, under the presence of computational errors.  For this algorithm each iteration consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we solve an auxiliary minimization problem on the set of feasible points. In each of these two steps there is a computational error. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE].  In Chapter 4 we analyze the projected gradient algorithm with a smooth objective function under the presence of computational errors.  In Chapter 5 we consider an algorithm, which is an extension of the projection gradient algorithm used for solving linear inverse problems arising in signal/image processing. In Chapter 6 we study continuous subgradient method and continuous subgradient projection algorithm for minimization of convex nonsmooth functions and for computing the saddle points of convex-concave functions, under the presence of computational errors.  All the results of this chapter has no prototype in [NOCE]. In Chapters 7-12 we analyze several algorithms under the presence of computational errors which were not considered in [NOCE]. Again, each step of an iteration has a computational errors and we take into account that these errors are, in general, different. An optimization problems with a composite objective function is studied in Chapter 7. A zero-sum game with two-players is considered in Chapter 8. A predicted decrease approximation-based method is used in Chapter 9 for constrained convex optimization. Chapter 10 is devoted tominimization of quasiconvex functions. Minimization of sharp weakly convex functions is discussed in Chapter 11. Chapter 12 is devoted to a generalized projected subgradient method for minimization of a convex function over a set which is not necessarily convex.The book is of interest for researchers and engineers working in optimization. It also can be useful in preparation courses for graduate students.  The main feature of the book which appeals specifically to this audience is the study of the influence of computational errors for several important optimization algorithms. The book is of interest for experts in applications of optimization  to engineering and economics.

The book is devoted to the study of approximate solutions of optimization problems in the presence of computational errors. It contains a number of results on the convergence behavior of algorithms in a Hilbert space, which are known as important tools for solving optimization problems. The research presented in the book is the continuation and the further development of the author's (c) 2016 book Numerical Optimization with Computational Errors, Springer 2016. Both books study the algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to find out what an approximate solution can be obtained and how many iterates one needs for this. The main difference between this new book and the 2016 book is that in this present book the discussion takes into consideration the fact that for every algorithm, its iteration consists of several steps and that computational errors for different steps are generally, different. This fact, which was not taken into account in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we calculate a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are different in general. It may happen that the feasible set is simple and the objective function is complicated. As a result, the computational error, made when one calculates the projection, is essentially smaller than the computational error of the calculation of the subgradient. Clearly, an opposite case is possible too. Another feature of this book is a study of a number of important algorithms which appeared recently in the literature and which are not discussed in the previous book. This monograph contains 12 chapters. Chapter 1 is an introduction. In Chapter 2 we study the subgradient projection algorithm for minimization of convex and nonsmooth functions. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 3 we analyze the mirror descent algorithm for minimization of convex and nonsmooth functions, under the presence of computational errors.  For this algorithm each iteration consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we solve an auxiliary minimization problem on the set of feasible points. In each of these two steps there is a computational error. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE].  In Chapter 4 we analyze the projected gradient algorithm with a smooth objective function under the presence of computational errors.  In Chapter 5 we consider an algorithm, which is an extension of the projection gradient algorithm used for solving linear inverse problems arising in signal/image processing. In Chapter 6 we study continuous subgradient method and continuous subgradient projection algorithm for minimization of convex nonsmooth functions and for computing the saddle points of convex-concave functions, under the presence of computational errors.  All the results of this chapter has no prototype in [NOCE]. In Chapters 7-12 we analyze several algorithms under the presence of computational errors which were not considered in [NOCE]. Again, each step of an iteration has a computational errors and we take into account that these errors are, in general, different. An optimization problems with a composite objective function is studied in Chapter 7. A zero-sum game with two-players is considered in Chapter 8. A predicted decrease approximation-based method is used in Chapter 9 for constrained convex optimization. Chapter 10 is devoted tominimization of quasiconvex functions. Minimization of sharp weakly convex functions is discussed in Chapter 11. Chapter 12 is devoted to a generalized projected subgradient method for minimization of a convex function over a set which is not necessarily convex.The book is of interest for researchers and engineers working in optimization. It also can be useful in preparation courses for graduate students.  The main feature of the book which appeals specifically to this audience is the study of the influence of computational errors for several important optimization algorithms. The book is of interest for experts in applications of optimization  to engineering and economics.

The discussion takes into consideration the fact that for every algorithm its iteration consists of several steps and that computational errors for di?erent steps are di?erent, in general.

This book is devoted to the study of a class of optimal control problems arising in mathematical economics, related to the Robinson–Solow–Srinivasan (RSS) model.

This book is devoted to the study of a class of optimal control problems arising in mathematical economics, related to the Robinson–Solow–Srinivasan (RSS) model.

This book is devoted to a detailed study of the subgradient projection method and its variants for convex optimization problems over the solution sets of common fixed point problems and convex feasibility problems.

This book is devoted to a detailed study of the subgradient projection method and its variants for convex optimization problems over the solution sets of common fixed point problems and convex feasibility problems.

Written by a leading expert in turnpike phenomenon, this book is devoted to the study of symmetric optimization, variational and optimal control problems in infinite dimensional spaces and turnpike properties of their approximate solutions.

Written by a leading expert in turnpike phenomenon, this book is devoted to the study of symmetric optimization, variational and optimal control problems in infinite dimensional spaces and turnpike properties of their approximate solutions.

The book is devoted to the study of constrained minimization problems on closed and convex sets in Banach spaces with a Frechet differentiable objective function.

In Chapter 9, the examination continues of the turnpike phenomenon for the continuous-time optimal control problems on subintervals of half-axis in metric spaces discussed in Chapter 8.

In Chapter 9, the examination continues of the turnpike phenomenon for the continuous-time optimal control problems on subintervals of half-axis in metric spaces discussed in Chapter 8.

The book is devoted to the study of approximate solutions of fixed point problems in the presence of computational errors. It begins with a study of approximate solutions of star-shaped feasibility problems in the presence of perturbations. The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems.The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems. A number of algorithms are considered for solving convex feasibility problems and common fixed point problems. The book will be of interest for researchers and engineers working in optimization, numerical analysis, and fixed point theory. It also can be useful in preparation courses for graduate students. The main feature of the book which appeals specifically to this audience is the study of the influence of computational errorsfor several important algorithms used for nonconvex feasibility problems.

The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems.The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems.

Fixed point theory of nonlinear operators has been a rapidly growing area of research and plays an important role in the study of variational inequalities, monotone operators, feasibility problems, and optimization theory, to name just several.