Duality principles for optimization problems dealing with the difference of vector-valued convex mappings

DOI10.1023/A:1015424423727MaRDI QIDQ700772zbMATH OpenFDO

Publication date 8 October 2002

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1015424423727

convex analysis Legendre-Fenchel transform subdifferentials

Nonsmooth analysis (49J52) Duality theory (optimization) (49N15) Optimality conditions and duality in mathematical programming (90C46)

Review text

Consider the following equivalent problems: \[ \min f(x)+g\bigl( G(x)-H(x) \bigr), \text{ on a vectorial space},\tag{P} \] and \[ \min f(x), \text{ for } G(x)-H(x)\leq 0,\tag{R} \] where \(f,g\) are convex functions and \(G,H\) are vector-valued mappings that are convex with respect to a partial vectorial order for which \(g\) is nondecreasing. In this paper the author obtains duality formulas for problems (P) and (R) in terms of the Legendre-Fenchel conjugates of the data functions. The author also provides relations between the optimal solutions of primal and dual problems and a general necessary optimality condition. In particular the author applies the results to the problem of minimization of the composite of a convex mapping with a nonincreasing convex function and the minimization of the upper envelope of a family of concave functions.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Duality principles for optimization problems dealing with the difference of vector-valued convex mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700772)