Composite convex programs

From MaRDI portal





In the convex program considered the objective and constraint functions are compositions of convex mappings; there are also linear constraints. Conjugate duality is used to construct a duality theory. This is applied to a minimax problem, in which the maximum is approximated by an \(L^ p\) norm for large \(p\); this leads to a convex approximate dual problem.











This page was built for publication: Composite convex programs

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