Infinite-dimensional convex programming with applications to constrained approximation |
| |
Authors: | V Jeyakumar |
| |
Institution: | (1) Department of Applied Mathematics, University of New South Wales, 2033 Kensington, New South Wales, Australia |
| |
Abstract: | In this paper, existence and characterization of solutions and duality aspects of infinite-dimensional convex programming problems are examined. Applications of the results to constrained approximation problems are considered. Various duality properties for constrained interpolation problems over convex sets are established under general regularity conditions. The regularity conditions are shown to hold for many constrained interpolation problems. Characterizations of local proximinal sets and the set of best approximations are also given in normed linear spaces.The author is grateful to the referee for helpful suggestions which have contributed to the final preparation of this paper. This research was partially supported by Grant A68930162 from the Australian Research Council. |
| |
Keywords: | Convex programming constrained interpolation dual problems constrained approximations constraint qualifications |
本文献已被 SpringerLink 等数据库收录! |