Abstract
Many questions in optimization and analysis reduce to solving a nonlinear equation h(x)=0, for some function h:E→E. Equivalently, if we define another map f=I−h (where I is the identity map), we seek a point x in E satisfying f(x)=x; we call x a fixed point of f.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2006). Fixed Points. In: Convex Analysis and Nonlinear Optimization. CMS Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-31256-9_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-31256-9_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-29570-1
Online ISBN: 978-0-387-31256-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)