| The formulation of many problems in science, engineering and management sciences is inseparably linked to convex analysis in that, the analysis of the nonlinear problems thereof and the characterization of their optimal solutions and the very development of the computational procedures all use convex sets. Minimizing a strictly convex functional arises often and many iterative processes are used. The question of convergence of some iterative processes is addressed.;The first half of Chapter I is devoted to achieving an algorithm for getting a point in the intersection of finitely many closed convex subsets of ;Solving ;Extensions of the theorems proved are discussed for further study. |
