The main purpose of this book is to present, in a unified approach, several algorithms for fixed point computation, convex feasibility and convex optimization in infinite dimensional Banach spaces, and for problems involving, eventually, infinitely many constraints.
1: Totally Convex Functions.- 1.1. Convex Functions and Bregman Distances.- 1.2. The Modulus of Total Convexity.- 1.3. Total Versus Locally Uniform Convexity.- 1.4. Particular Totally Convex Functions.- 2: Computation of Fixed Points.- 2.1. Totally Nonexpansive Operators.- 2.2. Totally Nonexpansive Families of Operators.- 2.3. Stochastic Convex Feasibility Problems.- 2.4. Applications in Particular Banach Spaces.- 3: Infinite Dimensional Optimization.- 3.1. A Proximal Point Method.- 3.2. Convergence of the Proximal Point Method.- 3.3. The Basics of a Duality Theory.- 3.4. An Augmented Lagrangian Method.- 3.5. Unconstrained Convex Minimization.
Get Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization by Alfredo N. Iusem, Dan Butnariu at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Kluwer Academic Publishers and it has 220 pages.
Our digital collection is currently being curated to ensure the best possible reading experience on Werezi. We'll be launching our Ebooks platform shortly.
Your privacy, your choice
Make Werezi work for you
We use essential cookies for your cart and sign-in. With your permission, optional cookies help us understand how Werezi is used and improve your book recommendations.
Essential cookies are always active. Optional analytics stay off unless you choose Allow all.