Duality for optimization and best approximation over finite intersections
作者:
Ivan Singer,
期刊:
Numerical Functional Analysis and Optimization
(Taylor Available online 1998)
卷期:
Volume 19,
issue 7-8
页码: 903-915
ISSN:0163-0563
年代: 1998
DOI:10.1080/01630569808816864
出版商: Marcel Dekker, Inc.
关键词: convex optimization;Lagrangian dual problem;m-Lagrangian dual problem;Strong conical hull intersection property;Nearest point;46N10;41A65
数据来源: Taylor
摘要:
Recently Deutsch, Li and Swetits [2] have studied, in Hilbert space, a dual problem (Qm) to the primal problem (P) of minimization of a special class of convex functionsfover the intersection ofmclosed convex sets, wheremis finite. In the first part of this paper we obtain, in a locally convex space, some results on problem (Qm) and on its relations with the usual Lagrangian dual problem (Q) to (P) (studied in [9]), in the case when (P) has a solution. In the second part we give some applications to duality for the distance to the intersection ofmclosed convex sets in a normed linear space, in the case when a nearest point exists. Most of our results seem to be new even in the particular cases studied in [9] (the casem= 1), [l] (duality formulas for the distance to the intersection ofmclosed half-spaces in a normed linear space) and [2].
点击下载:
PDF (1120KB)
返 回