Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
Ivan Singer · Optimization · 1987
We give some extensions of our duality theorems of [9] on the optimization problem (P) α =inf h(G), where G is a subset of a locally convex space Fsuch that F\G and are convex, to tne case whien G is a subsei of an arbitrary set F and is an arbitrary functional. We give some applications to the case when G is embedded into a family of sets where X is a parameter set.