Abstract
In this chapter, we study continuous analogs of algorithms for minimization of Frechet differentiable functions studied in Chaps. 2 and 3, under the presence of computational errors. We show that our algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barbu V, Precupanu T (2012) Convexity and optimization in Banach spaces. Springer, Heidelberg
Brezis H (1973) Operateurs maximaux monotones. North Holland, Amsterdam
Li X, Yong J (1995) Optimal control theory for infinite dimensional systems. Birkhauser, Boston
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Zaslavski, A.J. (2022). Continuous Algorithms. In: Optimization in Banach Spaces. SpringerBriefs in Optimization. Springer, Cham. https://doi.org/10.1007/978-3-031-12644-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-12644-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-12643-7
Online ISBN: 978-3-031-12644-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)