Totally Convex Functions For Fixed Points Computation And Infinite Dimensional Optimization

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. For instance methods like the simultaneous projection algorithm for feasibility the proximal point algorithm and the augmented Lagrangian algorithm are rigorously formulated and analyzed in this general setting and shown to be applicable t