Papers
Topics
Authors
Recent
Search
2000 character limit reached

Mordukhovich Limiting Subdifferentials

Updated 27 January 2026
  • Mordukhovich limiting subdifferentials are a fundamental concept defined via normal cones to the epigraph, extending classical differentiation to nonsmooth, nonconvex functions.
  • They enable rigorous calculus rules such as the sum and chain rules under qualification conditions, enhancing analysis in variational and sensitivity contexts.
  • Applications span nonsmooth optimization, coderivative analysis, and stability studies in both finite and infinite dimensional settings.

Mordukhovich limiting subdifferentials, also known as basic or limiting subdifferentials, form a foundational apparatus in variational analysis for characterizing and analyzing nonsmooth, nonconvex functions and set-valued mappings in both finite and infinite dimensional settings. They are closely linked to the theory of generalized differentiation developed by B. S. Mordukhovich and play a central role in subdifferential calculus, stability and sensitivity analysis, as well as optimality conditions in nonsmooth optimization.

1. Rigorous Definition and Elementary Properties

For an extended-real-valued function f:RnR{+}f: \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}, with xˉdomf\bar{x} \in \operatorname{dom} f, the Mordukhovich (limiting) subdifferential at xˉ\bar{x} is defined via the normal cone to the epigraph of ff by

f(xˉ):={xRn  |  (x,1)Nlim((xˉ,f(xˉ));epif)},\partial f(\bar{x}) := \left\{ x^* \in \mathbb{R}^n \;\middle|\; (x^*,-1) \in N_{\rm lim}\left((\bar{x},f(\bar{x})); \mathrm{epi}\,f\right) \right\},

where the limiting normal cone NlimN_{\rm lim} to a closed set ΩRn\Omega \subset \mathbb{R}^n at xˉ\bar{x} is

Nlim(xˉ;Ω):={vRn  |  xkxˉ,  vkv,  vkN^(xk;Ω)},N_{\rm lim}(\bar{x}; \Omega) := \left\{ v \in \mathbb{R}^n \;\middle|\; \exists \, x_k \to \bar{x},\; v_k \to v,\; v_k \in \widehat{N}(x_k; \Omega) \right\},

with N^(x;Ω)\widehat{N}(x;\Omega) the (Fréchet) regular normal cone, defined as

N^(x;Ω):={vRn  |  lim supyx,yΩv,yxyx0}.\widehat{N}(x; \Omega) := \left\{ v \in \mathbb{R}^n \;\middle|\; \limsup_{y \to x,\, y \in \Omega} \frac{\langle v, y-x \rangle}{\|y-x\|} \leq 0 \right\}.

Equivalent formulations include the “limits of gradients” when ff is locally Lipschitz, i.e.,

Lf(x)={pRn:(xk)x, xkD, f(xk)p},\partial_L f(x) = \left\{ p \in \mathbb{R}^n : \exists (x_k) \to x,\ x_k \in D,\ \nabla f(x_k) \to p \right\},

with DD the set of differentiability points of ff (Daniilidis et al., 2024).

Key features:

  • f(xˉ)\partial f(\bar{x}) is always closed, but not necessarily convex. Its convex hull recovers the Clarke (convexified) subdifferential.
  • For ff convex, f(xˉ)\partial f(\bar{x}) coincides with the classical convex subdifferential.
  • For fC1f \in C^1 near xˉ\bar{x}, f(xˉ)={f(xˉ)}\partial f(\bar{x}) = \{ \nabla f(\bar{x}) \}.
  • For indicator functions, the subdifferential corresponds to the normal cone (Benko et al., 2017, An et al., 2024).

2. Calculus Rules and Qualification Conditions

The calculus of limiting subdifferentials mirrors subdifferential rules in convex analysis, but essential differences arise due to nonconvexity. Principal rules include:

  • Sum Rule: For f1,f2f_1, f_2 lsc, finite at xˉ\bar{x},

(f1+f2)(xˉ)f1(xˉ)+f2(xˉ),\partial(f_1 + f_2)(\bar{x}) \subset \partial f_1(\bar{x}) + \partial f_2(\bar{x}),

with equality if one is locally Lipschitz at xˉ\bar{x}, provided the qualification condition 0f1(xˉ)+f2(xˉ)0 \notin \partial^\infty f_1(\bar{x}) + \partial^\infty f_2(\bar{x}) holds, where \partial^\infty denotes the singular subdifferential (Benko et al., 2017).

  • Chain Rule: For F:RnRmF: \mathbb{R}^n \to \mathbb{R}^m strictly differentiable at xˉ\bar{x}, g:RmR{+}g: \mathbb{R}^m \to \mathbb{R} \cup \{+\infty\} lsc at F(xˉ)F(\bar{x}),

(gF)(xˉ)F(xˉ)Tg(F(xˉ))\partial(g \circ F)(\bar{x}) \subset \nabla F(\bar{x})^T \partial g(F(\bar{x}))

under a no-singularity intersection with kerF(xˉ)T\ker \nabla F(\bar{x})^T; equality if gg is locally Lipschitz (Benko et al., 2017).

  • Scalar Multiple: For α>0\alpha > 0, (αf)(xˉ)=αf(xˉ)\partial(\alpha f)(\bar{x}) = \alpha \partial f(\bar{x}) and (αf)(xˉ)=αf(xˉ)\partial^\infty(\alpha f)(\bar{x}) = \alpha \partial^\infty f(\bar{x}).
  • Product Rule: If one function is C1C^1 near xˉ\bar{x}, an explicit product rule applies under a no-singularity condition (Benko et al., 2017).
  • Second-Order Subdifferential: For ff prox-regular at (xˉ,vˉ)(\bar{x},\bar{v}),

2f(xˉ,vˉ)(u):=D(f)(xˉ,vˉ)(u)={w(w,u)N((xˉ,vˉ);gphf)}\partial^2 f(\bar{x},\bar{v})(u) := D^* (\partial f)(\bar{x},\bar{v})(u) = \{ w \mid (w,-u) \in N((\bar{x},\bar{v}); \operatorname{gph} \partial f) \}

(An et al., 2024).

3. Directional and Set-Based Generalizations

Directional limiting subdifferentials refine sensitivity analysis by restricting sequences converging to xˉ\bar{x} along a prescribed direction uu. The directional limiting normal cone is defined as

Nlim(xˉ;u;Ω):={v:tk0, uku, xk=xˉ+tkukΩ, vkN^(xk;Ω), vkv}N_{\rm lim}(\bar{x}; u; \Omega) := \left\{ v : \exists t_k \downarrow 0,\ u_k \to u,\ x_k=\bar{x}+t_k u_k \in \Omega,\ v_k \in \widehat{N}(x_k; \Omega),\ v_k \to v \right\}

and the directional subdifferential analogously via the epigraph (Benko et al., 2017). Such constructions capture finer geometric information, especially important in stability and sensitivity analysis.

Generalized forms with respect to a closed set C\mathcal{C} are formulated as

Cf(x):={x(x,1)NC((x,f(x));epif)},\partial_\mathcal{C} f(x) := \{ x^* \mid (x^*,-1) \in N_\mathcal{C}((x,f(x)); \operatorname{epi} f) \},

with NCN_\mathcal{C} the limiting normal cone relative to C\mathcal{C}, enabling subdifferential calculus on constraint manifolds and in variational geometries (Qin et al., 2023).

4. Analytical and Geometric Pathologies

Recent results have demonstrated the geometric complexity of limiting subdifferentials, even for everywhere differentiable Lipschitz functions. For any nonempty compact convex set KRnK \subset \mathbb{R}^n with nonempty interior, there exists a differentiable locally Lipschitz function ff so that Lf(xˉ)=K\partial_L f(\bar{x}) = K at some xˉ\bar{x} (Daniilidis et al., 2024). This reveals a substantial gap between C1C^1 and merely differentiable functions in terms of subdifferential geometry, with upper semicontinuity and closedness being essentially the only universal regularity properties in the absence of higher smoothness.

5. Optimality and Stability: Necessary and Sufficient Conditions

The Mordukhovich subdifferential underpins necessary optimality conditions for minimization problems, both unconstrained and constrained. For uu^* a minimizer in Ls(Ω)L^s(\Omega) for

minuUadf(u)+Ωup,p[0,1),\min_{u \in U_{\mathrm{ad}}} f(u) + \int_\Omega |u|^p,\quad p \in [0,1),

Fermat-type (stationarity) conditions read

0f(u)+qs,p(u)+NUad(u),0 \in f'(u^*) + \partial q_{s,p}(u^*) + N_{U_{\mathrm{ad}}}(u^*),

where NUad(u)N_{U_{\mathrm{ad}}}(u^*) is the limiting normal cone to UadU_{\mathrm{ad}} at uu^* (Mehlitz et al., 2021).

Second-order optimality is characterized by the second-order limiting subdifferential of the Lagrangian. For a C1,1C^{1,1}-smooth constrained optimization problem, necessary and sufficient second-order conditions are formulated via the second-order limiting subdifferential

2L(xˉ,λ,μ)(v)\partial^2 L(\bar{x}, \lambda, \mu)(v)

in terms of directional positivity in the critical cone, extending the classical results to nonsmooth, nonconvex settings (An et al., 2024).

6. Applications and Representativity

The calculus of Mordukhovich subdifferentials, including coderivatives for multifunctions, is crucial in modern variational analysis—governing algorithms for optimization under nonsmooth or nonconvex settings, robust sensitivity theory, coderivative criteria for properties such as calmness and Lipschitz-like (Aubin) regularity, and the formulation of necessary optimality conditions in infinite-dimensional control and learning problems (Benko et al., 2017, Qin et al., 2023, An et al., 2024, Mehlitz et al., 2021).

Illustrative examples highlight the mechanisms and subtlety of the theory:

  • For f(x)=x+xf(x) = |x| + \sqrt{|x|}, the sum rule’s conclusion f(0)=[1,1]\partial f(0) = [-1,1] directly reflects the sum of subdifferentials with the qualification condition satisfied (Benko et al., 2017).
  • For functionals on Lebesgue spaces with sparsity-promoting terms (p\ell_p with p[0,1)p \in [0,1)), explicit formulas for both regular and limiting/ singular subdifferentials illuminate the interplay of nonconvexity, non-Lipschitzianity, and optimality structure (Mehlitz et al., 2021).

7. Summary Table: Subdifferential Types and Defining Properties

Subdifferential Type Definition Key Properties/Context
Fréchet (regular) subdifferential ^f(x)\widehat\partial f(x) Regular normals to epif\operatorname{epi} f or supporting inequalities Local support, closed, can be empty
Limiting (Mordukhovich) subdifferential f(x)\partial f(x) Limits (in pairs) of Fréchet normals/subgradients Always closed, not necessarily convex or single-valued
Clarke subdifferential Cf(x)\partial_C f(x) Convex hull of limiting subdifferential Convexified, captures all generalized directions

The Mordukhovich limiting subdifferential thus generalizes classical differentiation notions, bridging smooth, convex, and fully nonconvex settings, and provides the analytical machinery essential for advanced variational analysis, optimality, and stability in nonsmooth optimization and control (Benko et al., 2017, An et al., 2024, Daniilidis et al., 2024, Mehlitz et al., 2021, Qin et al., 2023, Drusvyatskiy et al., 2012).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Mordukhovich Limiting Subdifferentials.