E-Books →On Range Space Techniques, Convex Cones, Polyhedra and Optimization in Infinite Dimensions (PDF)

A Conical Approach to Linear Programming, Scalar and Vector Optimization
Problems, Gordon and Breach Science ✅Publishers, Amsterdam, 1997.
It expands and improves author's new approach to the Maximum Priciple for norm oprimal control of PDE, based on theory of convex cones, providing shaper results in various Hilbert space and Banach space settings. It provides a theory for convex hypersurfaces in lts and Hilbert spaces. For these purposes, it introduces new results and concepts, like the generalizations to the non compact case of cone capping and of the Krein Milman Theorem, an extended theory of closure of pointed cones, the notion of beacon points, and a necessary and sufficient condition of support for void interior closed convex set (complementing the Bishop Phelps Theorem), based on a new decomposition of non closed non pointed cones with non closed lineality space.