Convex Optimization in Infinite Dimensional Spaces.

Bibliographic Details
Title: Convex Optimization in Infinite Dimensional Spaces.
Authors: Morari, Manfred, Thoma, Manfred, Blondel, Vincent D., Boyd, Stephen P., Kimura, Hidenori, Mitter, Sanjoy K.
Source: Recent Advances in Learning & Control; 2008, p161-179, 19p
Abstract: The duality approach to solving convex optimization problems is studied in detail using tools in convex analysis and the theory of conjugate functions. Conditions for the duality formalism to hold are developed which require that the optimal value of the original problem vary continuously with respect to perturbations in the constraints only along feasible directions; this is sufficient to imply existence for the dual problem and no duality gap. These conditions are also posed as certain local compactness requirements on the dual feasibility set, based on a characterization of locally compact convex sets in locally convex spaces in terms of nonempty relative interiors of the corresponding polar sets. The duality theory and related convex analysis developed here have applications in the study of Bellman-Hamilton Jacobi equations and Optimal Transportation problems. See Fleming-Soner [8] and Villani [9]. [ABSTRACT FROM AUTHOR]
Copyright of Recent Advances in Learning & Control is the property of Springer eBooks and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
DOI: 10.1007/978-1-84800-155-8_12
Database: Complementary Index