Pith. sign in

REVIEW 3 major objections 5 minor 37 references

Mathematical Programs Using Tangential Subdifferentials

T0 review · 3 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For tangentially convex nonsmooth MPECs, Abadie-type constraint qualifications imply generalized stationary conditions; with generalized convexity, stationarity becomes global optimality.

desk verdict A workmanlike translation of convexificator-based MPEC optimality conditions to tangential subdifferentials; the conditional main theorem is plausible, but Theorem 4 and Corollary 3 rely on false closedness claims and the examples contain basic errors. read the letter →

arxiv 2509.03205 v1 pith:AJB2OEB6 submitted 2025-09-03 math.OC

Shashi Kant Mishra , Dheerendra Singh This is my paper · ORCID
classification math.OC MSC 90C2690C4649K99
keywords mathematicalprogramswithequilibriumconstraintstangentialsubdifferentialsconstraintqualificationsstationarypointnonsmoothanalysisgeneralizedconvexityAbadiequalificationoptimalityconditions
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies optimization problems whose constraints include a complementarity condition—mathematical programs with equilibrium constraints—when the objective and constraint functions are tangentially convex but not necessarily differentiable. It claims that the usual Abadie-type constraint qualifications can be rephrased using tangential subdifferentials, and that these conditions certify stationarity of local minimizers: a generalized strong stationarity under the GS-Abadie condition, and a generalized alternative stationarity under the MPEC-Abadie condition. It further claims that, under a generalized quasiconvexity assumption, the alternative stationarity condition is sufficient for global optimality. The interest is that the tangentially convex class covers convex, differentiable, and Clarke-regular functions, so a single framework yields multiplier certificates across a broad family of nonsmooth equilibrium-constrained problems.

What carries the argument

The central object is the tangential subdifferential of a tangentially convex function: $\partial_T J(k)=\{\xi:\langle\xi,d\rangle\le J'(k,d)\ \forall d\}$, a nonempty compact convex set whose support function recovers the directional derivative. Around this object the paper builds dual constraint cones—$\Pi(k^*)$ and $\Psi(k^*)$ from unions of tangential subdifferentials of the active inequality, equality, and complementarity constraints—and defines GS-ACQ and MPEC-ACQ by requiring $\Pi(k^*)\subseteq T(K,k^*)$ or $\Psi(k^*)\subseteq T(K,k^*)$. The argument then runs on convex separation: if $0\notin \partial_T J(k^*)+\Delta$, separation produces a direction $\nu$ with negative directional derivative for $J$; GS-ACQ places $\nu$ in the contingent cone of the feasible set, and local Lipschitzness turns the contingent direction into feasible points with strictly lower objective values, contradicting local optimality. The sufficient-optimality part uses $\partial_T$-pseudoconvexity and $\partial_T$-quasiconvexity to convert the multiplier inequality into a global comparison $J(k)\ge J(k^*)$.

What would settle it

Take the compact convex set $K=\{(x,y):(x-1)^2+y^2\le 1\}$, which contains the origin; its conic hull $\operatorname{cone}K=\{(x,y):x>0\}\cup\{(0,0)\}$ is not closed. A tangentially convex MPEC whose active constraint subdifferentials generate such a cone therefore escapes the closedness hypothesis of Theorem 2; checking whether a local minimizer at that point still satisfies GS-ACQ and admits GS-multipliers would determine whether the closedness condition can be dropped or whether the claimed necessity fails.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that the tangential subdifferential $\partial_T J(k)=\{\xi\in\mathbb{R}^n:\langle\xi,d\rangle\le J'(k,d)\ \text{for all } d\}$—a nonempty compact convex set whose support function is the directional derivative—can carry the entire MPEC stationarity theory. Theorem 2 proves that if $k^*$ is a local solution, $J$ is tangentially convex and locally Lipschitz at $k^*$, GS-ACQ holds at $k^*$, and the cone $\Delta$ generated by the active constraint subdifferentials is closed, then $k^*$ is a GS-stationary point. Theorem 4 proves the analogous implication from MPEC-ACQ to GA-stationarity, and Theorem 5 shows that GA-stationarity plus $\partial_T$-pseudoconvexity of the objective and $\partial_T$-quasiconvexity of the active constraints makes $k^*$ globally optimal. The paper also establishes a chain among constraint qualifications: MPEC weak reverse convex CQ implies MPEC Zangwill CQ, which implies MPEC Abadie CQ, and GS-ACQ implies MPEC-ACQ.

Load-bearing premise

The load-bearing premise is that the constraint cone $\Delta$ (and, in Theorem 4, $\Lambda$) built from tangential subdifferentials is closed, because the convex separation step needs closedness to produce stationarity multipliers; boundedness of the subdifferentials alone does not guarantee the cone is closed.

Editorial extensions

If this is right

  • Local minimizers of nonsmooth tangentially convex MPECs satisfying GS-ACQ with closed $\Delta$ are certified by GS-stationarity multipliers, giving a KKT-type certificate without differentiability.
  • When only MPEC-ACQ is available, GA-stationarity still holds, so weaker regularity still forces a multiplier condition at local minima.
  • Because GS-stationary points are GA-stationary, the two necessary conditions form a hierarchy in which stronger geometric regularity yields stronger multipliers.
  • The implication chain among constraint qualifications lets practitioners verify the weakest geometric assumption, for instance checking MPEC weak reverse convex CQ, and then inherit MPEC-ACQ stationarity conclusions.
  • Under $\partial_T$-pseudoconvex and $\partial_T$-quasiconvex hypotheses, GA-stationarity is both necessary and sufficient for global optimality, so the multiplier test completely characterizes solutions in that class.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The closedness gap suggests a natural repair: replace $\Delta$ or $\Lambda$ by its closure and aim for approximately stationary multipliers, or impose a separate closed-cone constraint qualification; the theorems would then survive in a limiting form.
  • The same machinery might extend to semidefinite or infinite-dimensional equilibrium constraints, since tangential subdifferentials remain compact and convex there, but separation arguments would need a closed cone in the ambient topology.
  • Because the sufficiency theorem only needs the generalized convexity on the active index sets, it may apply to complementarity reformulations of bilevel problems where the upper-level objective is mildly nonconvex.
  • A sharper testable extension is to construct an MPEC whose active constraint subdifferentials generate a nonclosed cone and check whether MPEC-ACQ plus a local minimum can coexist with the absence of GA-multipliers; if it can, Theorem 4 as stated is false.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper develops constraint qualifications, stationary concepts, and optimality conditions for nonsmooth mathematical programs with equilibrium constraints (MPEC) using tangential subdifferentials. It defines generalized standard Abadie (GS-ACQ), MPEC Abadie (MPEC-ACQ), MPEC Zangwill, and weak reverse convex constraint qualifications, introduces generalized strong (GS) and generalized alternative (GA) stationarity, and proves implications among the constraint qualifications. The main necessary optimality result is Theorem 2, which states that a local minimum satisfying GS-ACQ and a closed cone Δ is GS-stationary, and Theorem 4, which states that a local minimum satisfying MPEC-ACQ is GA-stationary. Theorem 5 gives a sufficient optimality condition under generalized convexity assumptions. The paper also provides examples illustrating the results.

Significance. If the results were fully valid, the paper would offer a natural extension of Abadie-type constraint qualifications and stationarity conditions for MPEC to the class of tangentially convex functions, whose tangential subdifferentials are compact and convex and have useful calculus rules. The paper is not circular: the proofs are direct separation arguments from explicit assumptions, and the dependence on cited results for tangential subdifferentials is normal foundational support. However, the main necessary conditions, especially Theorem 4 and Corollary 3, rest on an unjustified closedness assertion for the multiplier cone. This is a load-bearing gap because the separating hyperplane argument cannot be applied unless the cone is closed. Theorem 2 is conditionally sound because it explicitly assumes closedness of Δ, but the paper's claim that closedness is automatic is false. The paper therefore needs a substantive revision before its central claims can be accepted.

major comments (3)
  1. [§4, Theorem 4, proof of Eq. (13)] The proof states that Λ is closed and convex without any argument. This matters because the separation theorem is the only mechanism producing the multiplier system and the subsequent stationarity conclusion. A compact convex set containing the origin need not have a closed conic hull: for C = {(x,y) : 0≤x≤1, x²≤y≤1}, the points (1,1/n) = n(1/n,1/n²) lie in con C, but (1,0) does not. Such a C is realizable as the tangential subdifferential of the convex, hence tangentially convex, support function h(x)=sup_{c∈C}⟨c,x⟩ at the origin. Therefore boundedness or compactness of tangential subdifferentials does not imply closedness of Λ, and Theorem 4 is unsupported as stated; an explicit closedness assumption for Λ is required.
  2. [§4, Corollary 3] The proof of Corollary 3 asserts that Δ is closed because the tangential subdifferentials are bounded. The same counterexample as above shows that a nonempty compact convex set containing the origin can have a non-closed conic hull. Hence the corollary is not established, and the claimed automatic closedness is false. Theorem 2 itself is conditionally sound because its statement explicitly assumes Δ is closed; the defect is the claim that closedness follows from the standing assumptions.
  3. [§4, Theorem 4, final displayed conditions] After equation (14), the proof sets λ^G_Θ = λ^H_Υ = μ^G_Υ = μ^H_Θ = 0, but Definition 10 requires λ^G_Υ = λ^H_Θ = 0 for GA-stationarity. The preceding sentence contains the correct conditions, so this appears to be a typo; nevertheless, as written the proof's conclusion does not match the definition being proved.
minor comments (5)
  1. [§2, Example 2] For J(k1,k2)=|k1|+k2² at (0,0), the tangential subdifferential is the segment {(t,0) : -1≤t≤1}, not just the three listed points {(1,0),(-1,0),(0,0)}.
  2. [§4, Definition 11] The symbol β appears in the definition of GS-stationarity but is never defined; from the proof of Theorem 2 it is evidently meant to be the degenerate set Ω.
  3. [§4, Theorem 2 proof] The proof says that Δ is 'closed and bounded'; a nonzero cone is never bounded. The separation argument needs only closedness, so this should be corrected to avoid confusion.
  4. [§4, Theorem 5] The statement's condition 'ΩG_μ ∪ μH_i ∪ Θ+_μ ∪ Υ+_μ = φ' is garbled; it should presumably be ΩG_μ ∪ ΩH_μ ∪ Θ+_μ ∪ Υ+_μ = ∅. There is also a typo 'pseudoconvax' for 'pseudoconvex'.
  5. [§3, Remark 2] The remark says that for a smooth function 'any set that contains the gradient' is the tangential subdifferential; by Definition 3 the tangential subdifferential of a smooth function is exactly {∇J(k)}, so the wording should be corrected.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the optimality conditions are derived from explicit assumptions via standard separation arguments, not from their conclusions.

full rationale

The paper's core results are Theorem 2 and Theorem 4, which derive GS- and GA-stationarity from local optimality under Abadie-type constraint qualifications. The stationarity conditions are not assumed; they are the conclusion of a convex separation argument applied to ∂T J(k*) and the constraint cone. The definition of tangential subdifferentials is quoted from Martinez-Legaz [22], an external source, and the constraint qualifications are adapted from Ansari-Ardali et al. [2], also external. The proof of Theorem 2 explicitly assumes the cone Δ is closed and uses GS-ACQ to obtain a feasible descent direction contradicting local optimality; the resulting multiplier inclusion is then rewritten as GS-stationarity. This is a standard necessary-conditions derivation, not a renaming of the definition. Theorem 5 similarly proves sufficiency by combining the assumed GA-stationary inclusion with ∂T-quasiconvexity inequalities, which is a conditional implication rather than a circular loop. The paper does cite several works by Mishra and coauthors, but those citations concern background MPEC duality and optimality results and are not load-bearing for the new theorems. The main mathematical weakness flagged by the reader, namely the unsupported assertion that bounded tangential subdifferentials imply closedness of the cones Δ and Λ in Corollary 3 and Theorem 4, is a correctness or rigor gap, not a circularity: the argument does not assume the conclusion, it simply fails to establish a technical hypothesis. Accordingly, no circular step can be exhibited, and the appropriate circularity score is 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no free parameters and no invented entities. It relies on the theory of tangential subdifferentials from [22] and standard separation arguments. The main unstated premise is the closedness of the generated cones; this is explicitly assumed in Theorem 2 but asserted without proof in Theorem 4 and Corollary 3, where it is not generally true.

assumptions (4)
  • standard math Convex separation theorem for a compact convex set and a closed convex cone.
    Used in the proofs of Theorems 2 and 4 to separate the objective subdifferential from the constraint cone.
  • domain assumption Tangential subdifferentials are nonempty, compact, convex sets and satisfy the support-function representation J'(x,d)=max_{ξ in ∂TJ(x)}⟨ξ,d⟩ (Definition 3, citing [22]).
    The entire framework is built on this external result.
  • ad hoc to paper Finite unions of tangential subdifferentials generate closed cones.
    Used in Corollary 3 and asserted in Theorem 4. This is false in general: the cone over a compact convex set containing 0 need not be closed, as with the epigraph of x^2 near the origin.
  • domain assumption All problem functions are tangentially convex and directionally differentiable at the point of interest.
    Standard assumption stated in the preliminaries and used throughout the optimality theorems.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Mathematical Programs Using Tangential Subdifferentials." pith.science (2026). https://pith.science/paper/AJB2OEB6

@misc{pith2026250903205,
  author       = {Pith},
  title        = {Pith review of: Mathematical Programs Using Tangential Subdifferentials},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AJB2OEB6}},
  note         = {Machine review of arXiv:2509.03205}
}
read the original abstract

In this paper, we deal with constraint qualifications, the stationary concept and the optimality conditions for nonsmooth mathematical programs with equilibrium constraints. The main tool of our study is the notion of tangential subdifferentials. Using the notion of tangential subdifferentials, we present constraint qualifications (namely, generalized standard Abadie, MPEC Abadie, MPEC Zangwill, constraint qualifications) and stationary concepts, and also establish relationships between constraint qualifications. Further, we establish sufficient optimality conditions for mathematical programs using tangential subdifferentials and suitable generalized convexity notion. We also give some examples that verify our results.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

37 extracted references · 37 canonical work pages

  1. [1]

    Riccardi, R.: Optimality conditions for convex problems on intersections of non necessarily convex sets

    Allevi, E., Mart?nez-Legaz, J.E. Riccardi, R.: Optimality conditions for convex problems on intersections of non necessarily convex sets. J. Glob. Optim. 77, pp.143-155. (2020)

    work page 2020

  2. [2]

    Ansari-Ardali, A., Movahedian, N., Nobakhtian, S.: Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexi- ficators. Optim. 65(1), pp.67-85. (2016)

    work page 2016

  3. [3]

    3, New York, Springer

    Borwein, J.M., Lewis, A.S.: Convex analysis and nonlinear optimization theory and examples. 3, New York, Springer. (2010)

    work page 2010

  4. [4]

    New York (NY): Wiley- Interscience

    Clarke, F.H.: Optimization and Nonsmooth Analysis. New York (NY): Wiley- Interscience. (1983)

    work page 1983

  5. [5]

    Dutta, J., Chandra, S.: Convexificators, generalized convexity and vector opti- mization. Optim. 53, pp.77-94. (2004) 14

    work page 2004

  6. [6]

    Institute of Applied Mathematics and Statistics, University of Wurzburg

    Flegel, M.L., Kanzow, C.: Optimality conditions for mathematical programs with equilibrium constraints: Fritz John and Abadie-type approaches. Institute of Applied Mathematics and Statistics, University of Wurzburg. (2002)

    work page 2002

  7. [7]

    Flegel, M.L., Kanzow, C.: On the Guignard constraint qualification for mathe- matical programswith equilibrium constraints. Optim. 54, pp.517-534. (2005)

    work page 2005

  8. [8]

    Flegel M.L., Kanzow, C.: Abadie-type constraint qualification for mathematical programs with equlirium constraints. J. Optim. Theory Appl. 124, pp.595-614. (2005)

    work page 2005

Show all 37 references
  1. [9]

    Flegel, M.L., Kanzow, C.: A Fritz John approach to first order optimality conditions formathematical programs with equilibrium constraints. Optim. 52, pp.277-286. (2003)

    2003

  2. [10]

    Outrata J.V.: Optimality conditions for disjunctive pro- grams with application to mathematical programs with equilibrium constraints

    Flegel, M.L., Kanzow, C. Outrata J.V.: Optimality conditions for disjunctive pro- grams with application to mathematical programs with equilibrium constraints. Set-Valued Anal. 15, pp.139-162. (2006)

    2006

  3. [11]

    and Pandey, Y.: Duality for nonsmooth mathemat- ical programming problems with equilibrium constraints

    Guu, S.M., Mishra, S.K. and Pandey, Y.: Duality for nonsmooth mathemat- ical programming problems with equilibrium constraints. J. Inequal. Appl. pp.1-15.(2016)

    2016

  4. [12]

    Hiriart-Urruty, J.B., Ledyaev, Y.S.: A note on the characterization of the global maxima of a(tangentially) convex function over a convex set. J. Convex Anal. 3, pp.55-61. (1996)

    1996

  5. [13]

    Harker, P.T., Pang, J.S.: Existence of optimal solutions to mathematical programs with equilibrium constraints. Oper. Res. lett. 7(2), pp.61-64. (1988)

    1988

  6. [14]

    Jeyakumar, V., Luc, D.T.: Approximate Jacobian matrices for nonsmooth con- tinuous maps and C1-optimization. SIAM J. Control Optim. 36, pp.1815-1832. (1998)

    1998

  7. [15]

    and Kumar, P

    Joshi, B.C., Mishra, S.K. and Kumar, P. On semi-infinite mathematical program- ming problems with equilibrium constraints using generalized convexity. Journal of the Operations Research Society of China, 8, pp.619636. (2020)

    2020

  8. [16]

    Kyparisis, J.: On uniqueness of Kuhn-Tucker multipliers in nonlinear program- ming. Math. Program. 32, pp.242-246. (1985)

    1985

  9. [17]

    Lemarechal, C.: An introduction to the theory of nonsmooth optimization. Optim. 17, pp.827-858. (1986)

    1986

  10. [18]

    Li, X.F., Zhang, J.Z.: Necessary optimality conditions in terms of convexificators in Lipschitz optimization. J. Optim. Theory Appl. 131, pp.429-452. (2006) 15

    2006

  11. [19]

    Luo, Z.Q., Pang, J.S.,Ralph, D.,Wu S.Q.: Exact penalization and stationary con- ditions of mathematical programs with equilibrium constraints. Math. Program. 76, pp.19-76. (1996)

    1996

  12. [20]

    Mishra, S.K.: Nonsmooth mathematical programs with vanishing constraints in Banach spaces

    Laha, V., Singh, V., Pandey, Y. Mishra, S.K.: Nonsmooth mathematical programs with vanishing constraints in Banach spaces. In High-Dimensional Optimization and Probability: With a View Towards Data Science. pp.395-417. (2022)

    2022

  13. [21]

    Michel, P., Penot, J.P.: A generalized derivative for calm and stable functions. Differ. Integr. Equ. 5, pp.433-454. (1992)

    1992

  14. [22]

    Martinez-Legaz, J.E.: Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints. Optim. Lett. 9, pp.1017-

  15. [23]

    Mashkoorzadeh, F., Movahedian, N., Nobakhtian, S.: Optimality conditions for nonconvex constrained optimization problems. Numer. Funct. Anal. Optim. 40, pp.1918-1938. (2019)

    2019

  16. [24]

    Mordukhovich, B.S.: Variational analysis and generalized differentiation. I. Basic theory.Grundlehren der mathematischen wissenschaften [fundamental principles of mathematical sciences]. 330, Berlin: Springer-Verlag. (2006)

    2006

  17. [25]

    and Jaiswal, M

    Mishra, S.K. and Jaiswal, M. Optimality conditions and duality for semi-infinite mathematical programming problem with equilibrium constraints. Numerical Functional Analysis and Optimization, 36(4), pp.460-480. (2015)

    2015

  18. [26]

    Set Valued Anal

    Movahedian, N., Nobakhtian, S.: Constraint qualifications for nonsmooth math- ematical programs with equilibrium constraints. Set Valued Anal. 17, pp.63-95. (2009)

    2009

  19. [27]

    Outrata, J.V.: Optimality conditions for a class of mathematical programs with equilibrium constraints. Math. Oper. Res. 24, pp.627-644.(1999)

    1999

  20. [28]

    Pang, J.S., Fukushima, M.: Complementarity constraint qualifications and sim- plified B-stationarity conditions for mathematical programs with equilibrium constraints. Comput. Optim. Appl. 13, pp.111-136. (1999)

    1999

  21. [29]

    and Mishra, S.K.: Optimality conditions and duality for semi- infinite mathematical programming problems with equilibrium constraints, using convexificators

    Pandey, Y. and Mishra, S.K.: Optimality conditions and duality for semi- infinite mathematical programming problems with equilibrium constraints, using convexificators. Ann. Oper. Res. 269, pp.549-564. (2018)

    2018

  22. [30]

    and Mishra, S.K.: On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints

    Pandey, Y. and Mishra, S.K.: On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints. Oper. Res. Lett. 44(1), pp.148-151. (2016) 16

    2016

  23. [31]

    Marcel Dekker Inc, New York

    Pshenichnyi, B.N.: Necessary Conditions for an Extremum. Marcel Dekker Inc, New York. (1971)

    1971

  24. [32]

    Scheel, H., Scholtes S.: Mathematical programs with complementarity constraints: stationarity, optimality and sensitivity. Math. Oper. Res. 25, pp.1-22.(2000)

    2000

  25. [33]

    Sisarat, N., Wangkeeree, R.: Characterizing the solution set of convex optimiza- tion problems without convexity of constraints. Optim. Lett. 14, pp.1127-1144. (2020)

    2020

  26. [34]

    Sisarat, N., Wangkeeree, R., Lee, G.M.: KKT optimality conditions in non- smooth, non-convex optimization. J. Nonlinear Convex Anal. 19, pp.1319-1329. (2018)

    2018

  27. [35]

    Ye, J.J.: Necessary and sufficient optimality conditions formathematical program- swith equilibrium constraints. J. Math. Anal. Appl. 307: pp.350-369. (2005)

    2005

  28. [36]

    and Mishra, S.K

    Singh, Y., Pandey, Y. and Mishra, S.K. Saddle point optimality criteria for mathematical programming problems with equilibrium constraints. Operations Research Letters, 45(3), pp.254-258. (2017)

    2017

  29. [37]

    (1969) 17

    Zangwill, W.I.: Nonlinear programming: a unified approach, Englewood Cliffs (NJ), Prentice-Hall. (1969) 17

    1969

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.