Cantitate/Preț
Produs

Optimization in Banach Spaces: SpringerBriefs in Optimization

Autor Alexander J. Zaslavski
en Limba Engleză Paperback – 30 sep 2022
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 problemwhich 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.




Citește tot Restrânge

Din seria SpringerBriefs in Optimization

Preț: 37982 lei

Nou

Puncte Express: 570

Preț estimativ în valută:
7269 7579$ 6041£

Carte tipărită la comandă

Livrare economică 21 martie-04 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031126437
ISBN-10: 3031126432
Pagini: 126
Ilustrații: VIII, 126 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.22 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria SpringerBriefs in Optimization

Locul publicării:Cham, Switzerland

Cuprins

Preface.- Introduction.- Convex optimization.-  Nonconvex optimization.- Continuous algorithms.- References.

Recenzii

“The book thus presents a complete study of optimization problems in Banach spaces. The proofs of the different results are given with lengthy details. The book being well structured, the reader will easily find the algorithm which may solve his own optimization problem.” (Alain Brillard, zbMATH 1504.49002, 2023)

Notă biografică

​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).

Caracteristici

Studies convex optimization problems in a general Banach space under the presence of computational errors Studies nonconvex optimization problems in a general Banach space under the presence of computational errors Studies continuous algorithms in a general Banach space under the presence of computational errors