A note on subdifferentials of convex composite functionals
From MaRDI portal
Publication:1924975
DOI10.1007/BF01195240zbMath0854.49017MaRDI QIDQ1924975
Publication date: 22 November 1996
Published in: Archiv der Mathematik (Search for Journal in Brave)
Convex programming (90C25) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27)
Related Items (12)
Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Nonlinear evolution equation associated with hypergraph Laplacian ⋮ A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces ⋮ Asymptotical good behavior on inequalities with completely approximate K-T concept ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems ⋮ Variational convergence of composed convex functions ⋮ Unnamed Item ⋮ Gap continuity of multimaps ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Convex analysis and measurable multifunctions
- The occasional distributivity of ∘ over+e and the change of variable formula for conjugate functions
- Regularity and Stability for Convex Multivalued Functions
- CONVEX OPERATORS
- SUBLINEAR OPERATORS AND THEIR APPLICATIONS
- Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
- On the Existence of Pareto Efficient Points
- Convex Analysis
This page was built for publication: A note on subdifferentials of convex composite functionals
