A formula on the approximate subdifferential of the difference of convex functions

Cites Work

A duality principle for non-convex optimisation and the calculus of variations
Limiting behaviour of the approximate first order and second order directional derivatives for a convex function

Cited In (28)

Some conjugation formulas and subdifferential formulas of convex analysis revisited
Refined optimality conditions for differences of convex functions
An extension of D.C. duality theory, with an appendix on ∗-subdifferentials
The directional subdifferential of the difference of two convex functions
On the subdifferentiability of the difference of two functions and local minimization
On minima of the difference of functions
Optimality conditions for D.C. vector optimization problems under reverse convex constraints
The deconvolution operation in convex analysis: an introduction
Necessary and sufficient optimality conditions in DC semi-infinite programming
Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
Jets, generalised convexity, proximal normality and differences of functions
Simplified optimality conditions for minimizing the difference of vector-valued functions
Optimality conditions for the difference of convex set-valued mappings
Sufficient optimality conditions for a bilevel semivectorial D.C. problem
Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
Calculus rules for global approximate minima and applications to approximate subdifferential calculus
On difference convexity of locally Lipschitz functions
On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
Weak convexity and approximate subdifferentials
On the optimality conditions for D.C. vector optimization problems
Title not available (Why is that?)
A formula on the subdifferential of the deconvolution of convex functions
Characterizing approximate global minimizers of the difference of two abstract convex functions with applications
Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
Title not available (Why is that?)
Optimality conditions in DC-constrained mathematical programming problems
Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
On computing the Mordukhovich subdifferential using directed sets in two dimensions

This page was built for publication: A formula on the approximate subdifferential of the difference of convex functions

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