Fixed Point Optimization Algorithms and Their Applications discusses how the relationship between fixed point algorithms and optimization problems is connected and demonstrates hands-on applications of the algorithms in fields such as image restoration, signal recovery, and machine learning. The book is divided into nine chapters beginning with foundational concepts of normed linear spaces, Banach spaces, and Hilbert spaces, along with nonlinear operators and useful lemmas and theorems for proving the book's main results. The author presents algorithms for nonexpansive and generalized nonexpansive mappings in Hilbert space, and presents solutions to many optimization problems across a range of scientific research and real-world applications. From foundational concepts, the book proceeds to present a variety of optimization algorithms, including fixed point theories, convergence theorems, variational inequality problems, minimization problems, split feasibility problems, variational inclusion problems, and equilibrium problems. Fixed Point Optimization Algorithms and Their Applications equips readers with the theoretical mathematics background and necessary tools to tackle challenging optimization problems involving a range of algebraic methods, empowering them to apply these techniques in their research, professional work, or academic pursuits.
Format:Paperback
Language:English
ISBN:0443335869
ISBN13:9780443335860
Release Date:December 2024
Publisher:Morgan Kaufmann Publishers
Length:244 Pages
Weight:1.15 lbs.
Dimensions:0.5" x 7.5" x 9.3"
Recommended
Format: Paperback
Condition: New
$177.40
Save $2.60!
List Price $180.00
On Backorder
If the item is not restocked at the end of 90 days, we will cancel your backorder and issue you a refund.
ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $20. ThriftBooks.com. Read more. Spend less.