The directional subdifferential of the difference of two convex functions
From MaRDI portal
Publication:628751
DOI10.1007/s10898-010-9615-8zbMath1223.26030OpenAlexW2060409023MaRDI QIDQ628751
Publication date: 14 March 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9615-8
Fréchet subdifferentialDC functionapproximately pseudo-dissipative operatorapproximately starshaped functiondirectional subdifferentialFenchel-Moreau subdifferential
Continuity and differentiation questions (26B05) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Calculus of directional subdifferentials and coderivatives in Banach spaces ⋮ Calculus rules of generalized \(\epsilon\)-subdifferential for vector valued mappings and applications ⋮ On Minty variational principle for nonsmooth vector optimization problems with approximate convexity ⋮ On the optimality conditions for D.C. vector optimization problems ⋮ Directional subdifferentials and optimality conditions ⋮ Calculus of directional coderivatives and normal cones in Asplund spaces ⋮ \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem ⋮ Free time optimization of second-order differential inclusions with endpoint constraints ⋮ On approximately star-shaped functions and approximate vector variational inequalities ⋮ Starshaped sets ⋮ Optimality conditions for vector optimization problems with difference of convex maps ⋮ A Minty variational principle for set optimization ⋮ Error bounds for the difference of two convex multifunctions ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ On approximate starshapedness in multiobjective optimization ⋮ Scalar representation and conjugation of set-valued functions ⋮ A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps ⋮ Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On functions representable as a difference of convex functions
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Approximately convex functions and approximately monotonic operators
- Gap continuity of multimaps
- On the subdifferentiability of the difference of two functions and local minimization
- Approximation and decomposition properties of some classes of locally d.c. functions
- How to regularize a difference of convex functions
- Duality in nonconvex optimization
- On the minimization of difference functions
- Global optimality conditions for nonconvex optimization
- Mutational and morphological analysis. Tools for shape evolution and morphogenesis
- Handbook of global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming: overview.
- Softness, sleekness and regularity properties in nonsmooth analysis
- Subsmooth sets: Functional characterizations and related concepts
- A closedness condition and its applications to DC programs with convex constraints
- On compositions of d.c. functions and mappings
- A General Formula on the Conjugate of the Difference of Functions
- Conjugaison par tranches et dualitë de toland
- Submonotone Subdifferentials of Lipschitz Functions
- A formula on the approximate subdifferential of the difference of convex functions
- Affine and eclipsing multifunctions
- Regularization by erasement
- Shorter Notes: Differentiability of the Metric Projection in Finite- Dimensional Euclidean Space
- Tangentially ds functions
- Introduction to global optimization.
- Duality for anticonvex programs.
- Simplified optimality conditions for minimizing the difference of vector-valued functions
This page was built for publication: The directional subdifferential of the difference of two convex functions
