ISSN:
1573-2878
Keywords:
Convex optimization
;
Fenchel duality
;
best approximation in Hilbert space
;
strong conical hull intersection property
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We study a special dual form of a convex minimization problem in a Hilbert space, which is formally suggested by Fenchel dualityand is useful for the Dykstra algorithm. For this special duality problem, we prove that strong duality holds if and only if the collection of underlying constraint sets {C 1,...,C m} has the strong conical hull intersection property. That is, $$\left( {\mathop \cap \limits_1^m C_i - x)^ \circ = \sum\limits_1^m {(C_1 - x} } \right)^ \circ {\text{, for each }}x \in \mathop \cap \limits_1^m C_1$$ where D° denotes the dual cone of D. In general, we can establish weak duality for a convex minimization problem in a Hilbert space by perturbing the constraint sets so that the perturbed sets have the strong conical hull intersection property. This generalizes a result of Gaffke and Mathar.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1022658308898
Permalink
