Convex programming with set functions

From MaRDI portal





The concepts of subdifferential and conjugate function are extended to convex set functions. Optimality conditions for convex programs with set functions are then characterized by subdifferentials of set functions involved. Duality theorems of Wolfe type for convex programs with set functions are also developed.




Cited in
(24)








This page was built for publication: Convex programming with set functions

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