Strict Robinson Constraint Qualification

• SRCQ is a first-order regularity condition defined by replacing the full tangent cone with the multiplier-specific critical cone in conic programming.
• It plays a key role in ensuring robust isolated calmness by controlling multiplier degeneracy and is equivalent to unique multipliers under Robinson CQ.
• Combined with second-order sufficient conditions, SRCQ stabilizes the KKT solution mapping in nonlinear, semidefinite, and second-order cone programming.

Searching arXiv for the cited papers to ground the article and confirm relevant context. Searching arXiv for “(Ding et al., 2016) Strict Robinson Constraint Qualification” and closely related recent work. The Strict Robinson Constraint Qualification (SRCQ) is a multiplier-dependent first-order regularity condition for constrained optimization, most prominently formulated in conic programming as a strengthening of the Robinson constraint qualification obtained by replacing the full tangent cone with the critical cone relative to a specific multiplier. In the conic framework studied in "Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems" (Ding et al., 2016), SRCQ is imposed at a KKT point $(\bar x,\bar y)$ and serves as the exact first-order condition, together with a suitable second-order sufficient condition, for robust isolated calmness of the KKT solution mapping. Its significance lies in its explicit control of multiplier degeneracy, its equivalence to multiplier uniqueness under Robinson CQ, and its role in separating intermediate stability properties from stronger Lipschitzian regimes.

1. Formal definition in conic programming

A standard setting is the conic program

$$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$

where $\mathcal X,\mathcal Y$ are finite-dimensional Euclidean spaces, $f:\mathcal X\to\mathbb R$ and $G:\mathcal X\to\mathcal Y$ are twice continuously differentiable, and $\mathcal K\subseteq\mathcal Y$ is a closed convex set that is assumed to be $C^2$-cone reducible at relevant points (Ding et al., 2016). The unperturbed problem is

$$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$

Its Lagrangian is

$L(x;y)=f(x)+\langle y,G(x)\rangle,$

and at a feasible point $\bar x$ the multiplier set is

$$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$0

At a locally optimal solution $$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$1 and a multiplier $$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$2, the Robinson constraint qualification (RCQ) is

$$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$3

whereas the Strict Robinson Constraint Qualification is

$$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$4

Using the critical cone to $$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$5 at $$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$6 relative to $$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$7,

$$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$8

the same condition can be written as

$$\begin{array}{ll} \min & f(x)-\langle a,x\rangle \ \text{s.t.} & G(x)+b\in \mathcal K, \end{array}$$9

This formulation makes clear that SRCQ is obtained from RCQ by replacing the full tangent cone with the smaller cone $\mathcal X,\mathcal Y$0. The dependence on $\mathcal X,\mathcal Y$1 is explicit: SRCQ is multiplier-dependent, so if the multiplier set is not a singleton, SRCQ may hold for one multiplier and fail for another (Ding et al., 2016).

2. Relationship to Robinson CQ, critical geometry, and multiplier uniqueness

SRCQ strictly strengthens RCQ because

$\mathcal X,\mathcal Y$2

In the same conic framework, constraint nondegeneracy is

$\mathcal X,\mathcal Y$3

which is stronger than SRCQ in general (Ding et al., 2016).

The key geometric object behind SRCQ is the critical cone. For a feasible point $\mathcal X,\mathcal Y$4,

$\mathcal X,\mathcal Y$5

and at a KKT pair $\mathcal X,\mathcal Y$6,

$\mathcal X,\mathcal Y$7

Thus SRCQ is not merely a feasibility condition; it is a surjectivity condition relative to the multiplier-selected slice of the tangent cone that is relevant for critical directions.

A central result is that, under RCQ, SRCQ at $\mathcal X,\mathcal Y$8 with respect to $\mathcal X,\mathcal Y$9 is equivalent to uniqueness of the Lagrange multiplier $f:\mathcal X\to\mathbb R$0. The paper also uses the equivalent dual-space characterization

$f:\mathcal X\to\mathbb R$1

or closely related annihilator formulations, in proving multiplier uniqueness and in the graphical derivative analysis (Ding et al., 2016). This multiplier-uniqueness interpretation is one of the main reasons SRCQ is regarded as the correct strict first-order strengthening of RCQ in this setting.

A useful comparison is summarized below.

Condition	Formula	Main role
RCQ	$f:\mathcal X\to\mathbb R$2	Existence of multipliers and basic KKT validity
SRCQ	$f:\mathcal X\to\mathbb R$3	Multiplier uniqueness and first-order regularity for robust isolated calmness
Constraint nondegeneracy	$f:\mathcal X\to\mathbb R$4	Stronger stability, including Aubin-type behavior

A common misconception is that SRCQ is interchangeable with constraint nondegeneracy or strict complementarity. In the conic framework of (Ding et al., 2016), it is neither: constraint nondegeneracy is stronger, and in semidefinite programming SRCQ is described as a semidefinite analogue of strict complementarity-type regularity, though not identical to strict complementarity.

3. Exact role in robust isolated calmness and second-order theory

The KKT solution mapping for the perturbed problem is

$f:\mathcal X\to\mathbb R$5

A multifunction $f:\mathcal X\to\mathbb R$6 is robustly isolated calm at $f:\mathcal X\to\mathbb R$7 for $f:\mathcal X\to\mathbb R$8 if there exist neighborhoods $f:\mathcal X\to\mathbb R$9 of $G:\mathcal X\to\mathcal Y$0, $G:\mathcal X\to\mathcal Y$1 of $G:\mathcal X\to\mathcal Y$2, and $G:\mathcal X\to\mathcal Y$3 such that

$G:\mathcal X\to\mathcal Y$4

and

$G:\mathcal X\to\mathcal Y$5

In the conic setting of (Ding et al., 2016), the central theorem states that if $G:\mathcal X\to\mathcal Y$6 and $G:\mathcal X\to\mathcal Y$7 are $G:\mathcal X\to\mathcal Y$8, $G:\mathcal X\to\mathcal Y$9 is $\mathcal K\subseteq\mathcal Y$0-cone reducible, RCQ holds at $\mathcal K\subseteq\mathcal Y$1, and $\mathcal K\subseteq\mathcal Y$2, then

$\mathcal K\subseteq\mathcal Y$3

This is an exact iff characterization, not merely a sufficient condition (Ding et al., 2016).

The second-order sufficient condition used there is

$\mathcal K\subseteq\mathcal Y$4

when multiplier uniqueness is available. Here $\mathcal K\subseteq\mathcal Y$5 is the second-order tangent set and $\mathcal K\subseteq\mathcal Y$6 is the support function

$\mathcal K\subseteq\mathcal Y$7

The division of labor between the two conditions is precise. SRCQ provides the first-order regularity needed to eliminate abnormal multiplier perturbation directions and enforce multiplier uniqueness. SOSC provides strict curvature along nonzero critical primal directions. Together they force the linearized KKT system to have only the trivial solution, which is exactly the variational signature of isolated calmness.

4. Variational mechanism and stability hierarchy

The variational analysis in (Ding et al., 2016) proceeds through graphical derivatives. For a set-valued mapping $\mathcal K\subseteq\mathcal Y$8, the graphical derivative at $\mathcal K\subseteq\mathcal Y$9 is

$C^2$0

A standard criterion used in the paper is

$C^2$1

For the KKT system, the analysis is organized through the natural mapping

$C^2$2

and tangent directions $C^2$3 satisfy the derivative system

$C^2$4

The only solution being $C^2$5 is the analytical signature of isolated calmness (Ding et al., 2016).

Within this mechanism, SRCQ enters by killing dual perturbation directions that survive under RCQ alone, while SOSC excludes nonzero primal critical directions. This is why RCQ alone is not enough, and why SOSC alone is not enough, for robust isolated calmness.

The same paper distinguishes three nested stability properties: $C^2$6 with reverse implications failing in general. A central point is that robust isolated calmness does not require constraint nondegeneracy; it is exactly captured by SRCQ plus SOSC. By contrast, for the Aubin property a stronger first-order condition, essentially constraint nondegeneracy, is needed (Ding et al., 2016).

5. Special cases and standard interpretations

The conic formulation in (Ding et al., 2016) covers polyhedral cones, the positive semidefinite cone, and second-order cones. In standard subclasses, SRCQ reduces to more familiar strict regularity conditions.

In nonlinear programming, when

$C^2$7

or a product of equality and inequality cones, SRCQ reduces to the classical strict constraint qualification involving active inequality gradients, equality gradients, and multiplier-dependent active sets. This is the finite-dimensional nonlinear programming analogue of the conic definition (Ding et al., 2016).

In nonlinear semidefinite programming, for

$C^2$8

SRCQ becomes

$C^2$9

with matrix inner product and orthogonality. The source describes this as the semidefinite analogue of strict complementarity-type regularity, though not identical to strict complementarity (Ding et al., 2016).

For second-order cone programming, the same framework applies through $$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$0-cone reducibility. The source also emphasizes that the characterization by SRCQ plus SOSC is a genuine extension of known nonlinear programming and polyhedral conic results to general $$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$1-cone reducible conic problems.

A further misconception concerns multiplier-independence. Because SRCQ uses $$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$2, it is not a purely primal property. It is a property of a KKT pair, not merely of a feasible point. This dependence is essential rather than incidental: it is precisely what allows the condition to isolate a specific multiplier and connect first-order geometry to stability of the KKT mapping.

6. Later formulations and related qualification conditions

Subsequent work has extended the same basic idea to other geometric settings while also clarifying what does and does not count as an SRCQ analogue.

For nonsmooth optimization on Riemannian manifolds, "On the robust isolated calmness of a class of nonsmooth optimizations on Riemannian manifolds and its applications" defines the manifold strict Robinson constraint qualification (M-SRCQ) as

$$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$3

This is the intrinsic manifold analogue of Euclidean SRCQ, obtained by replacing the ambient decision space with the tangent space $$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$4. The paper states that M-SRCQ implies uniqueness of the Lagrange multiplier and that, together with the manifold second-order sufficient condition, it is equivalent to robust isolated calmness of the manifold KKT solution mapping (Bao et al., 2022).

In abstract Banach-space optimization, "Uniqueness and stability of Lagrange multipliers and associated qualification conditions" studies the strict Robinson–Zowe–Kurcyusz condition

$$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$5

This is not the same condition as conic SRCQ in finite-dimensional KKT theory, but it is a closely related strict qualification condition tied to uniqueness and isolated calmness of a restricted Lagrange multiplier mapping. In finite-dimensional $$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$6 with polyhedric $$\begin{array}{ll} \min & f(x) \ \text{s.t.} & G(x)\in \mathcal K. \end{array}$$7, the paper gives equivalence between strict RZKC, isolated calmness, and weak strict tangent-cone variants (Mehlitz et al., 4 Jun 2026).

At the same time, several later conic papers deliberately avoid SRCQ and instead develop different regularity mechanisms. Some replace nondegeneracy by Robinson CQ plus a weak constant rank property in second-order analysis for nonlinear semidefinite and second-order cone programming (Fukuda et al., 2022). Others introduce minimal-face or facial constant-rank conditions that are weaker than Robinson CQ and enable local facial reduction, rather than using SRCQ at all (Andreani et al., 2023). These developments do not displace SRCQ in the perturbation-stability role identified in (Ding et al., 2016); rather, they show that different problems require different regularity notions depending on whether the target property is KKT isolated calmness, second-order necessary optimality with a single multiplier, or local reformulation on a minimal face.

In that sense, SRCQ occupies a specific position in the regularity landscape. It is the multiplier-dependent first-order strengthening of RCQ that exactly captures robust isolated calmness of the KKT solution mapping in the conic stability theory of (Ding et al., 2016). Stronger notions such as constraint nondegeneracy are needed for sharper Lipschitzian stability, while weaker or alternative notions may suffice for other objectives such as M-stationarity, single-multiplier second-order necessity, or facial reduction.