Optimization in Banach Spaces
sep. 2022 · Springer Nature
E-bok
126
Sidor
reportBetyg och recensioner verifieras inte Läs mer
Om den här e-boken
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. Such problems are well studied in a finite-dimensional space and in an infinite-dimensional Hilbert space. When the space is Hilbert there are many algorithms for solving optimization problems including the gradient projection algorithm which is one of the most important tools in the optimization theory, nonlinear analysis and their applications. An optimization problem is described by an objective function and a set of feasible points. For the gradient projection algorithm each iteration consists of two steps. The first step is a calculation of a gradient 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. In our recent research we show that the gradient projection algorithm generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. It should be mentioned that the properties of a Hilbert space play an important role. When we consider an optimization problem in a general Banach space the situation becomes more difficult and less understood. On the other hand such problems arise in the approximation theory. The book is of interest for mathematicians 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 algorithms for convex and nonconvex minimization problems in a general Banach space. The book is of interest for experts in applications of optimization to the approximation theory.
In this book the goal is to obtain a good approximate solution of the constrained optimization problem in a general Banach space under the presence of computational errors. It is shown that the algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a small constant. The book consists of four chapters. In the first we discuss several algorithms which are studied in the book and prove a convergence result for an unconstrained problem which is a prototype of our results for the constrained problem. In Chapter 2 we analyze convex optimization problems. Nonconvex optimization problems are studied in Chapter 3. In Chapter 4 we study continuous algorithms for minimization problems under the presence of computational errors. The algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a small constant. The book consists of four chapters. In the first we discuss several algorithms which are studied in the book and prove a convergence result for an unconstrained problem which is a prototype of our results for the constrained problem. In Chapter 2 we analyze convex optimization problems. Nonconvex optimization problems are studied in Chapter 3. In Chapter 4 we study continuous algorithms for minimization problems under the presence of computational errors.
In this book the goal is to obtain a good approximate solution of the constrained optimization problem in a general Banach space under the presence of computational errors. It is shown that the algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a small constant. The book consists of four chapters. In the first we discuss several algorithms which are studied in the book and prove a convergence result for an unconstrained problem which is a prototype of our results for the constrained problem. In Chapter 2 we analyze convex optimization problems. Nonconvex optimization problems are studied in Chapter 3. In Chapter 4 we study continuous algorithms for minimization problems under the presence of computational errors. The algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a small constant. The book consists of four chapters. In the first we discuss several algorithms which are studied in the book and prove a convergence result for an unconstrained problem which is a prototype of our results for the constrained problem. In Chapter 2 we analyze convex optimization problems. Nonconvex optimization problems are studied in Chapter 3. In Chapter 4 we study continuous algorithms for minimization problems under the presence of computational errors.
Om författaren
Alexander J. Zaslavski is professor in the Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel. He has authored numerous books with Springer, the most recent of which include Turnpike Phenomenon and Symmetric Optimization Problems (978-3-030-96972-1), Turnpike Theory for the Robinson–Solow–Srinivasan Model (978-3-030-60306-9), The Projected Subgradient Algorithm in Convex Optimization (978-3-030-60299-4), Convex Optimization with Computational Errors (978-3-030-37821-9), Turnpike Conditions in Infinite Dimensional Optimal Control (978-3-030-20177-7), Optimization on Solution Sets of Common Fixed Point Problems (978-3-030-78848-3).
Betygsätt e-boken
Berätta vad du tycker.
Läsinformation
Smartphones och surfplattor
Installera appen Google Play Böcker för Android och iPad/iPhone. Appen synkroniseras automatiskt med ditt konto så att du kan läsa online eller offline var du än befinner dig.
Laptops och stationära datorer
Du kan lyssna på ljudböcker som du har köpt på Google Play via webbläsaren på datorn.
Läsplattor och andra enheter
Om du vill läsa boken på enheter med e-bläck, till exempel Kobo-läsplattor, måste du ladda ned en fil och överföra den till enheten. Följ anvisningarna i hjälpcentret om du vill överföra filerna till en kompatibel läsplatta.
