The main purpose of this book is to present, in a unified approach, se veral algorithms for fixed point computation, convex feasibility and c onvex optimization in infinite dimensional Banach spaces, and for prob lems involving, eventually, infinitely many constraints. For instance, methods like the simultaneous projection algorithm for feasibility, t he proximal point algorithm and the augmented Lagrangian algorithm are rigorously formulated and analyzed in this general setting and shown to be applicable to much wider classes of problems than previously kno wn. For this purpose, a new basic concept, >total convexity', is intro duced. Its properties are deeply explored, and a comprehensive theory is presented, bringing together previously unrelated ideas from Banach space geometry, finite dimensional convex optimization and functional analysis. | Totally Convex Functions For Fixed Points Computation And Infinite Dimensional Optimization by Butnariu Butnariu, Hardcover | Indigo Chapters