On the public citation graph
A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
0 signed · 31 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jmaa.1994.1431openalex-snapshot
Structural Analysis of Nonsmooth Mappings, Inverse Functions, and Metric Projections
inferredcites →https://doi.org/10.1007/bf00120665openalex-snapshot
Nonlinear optimization: Characterization of structural stability
inferredcites →https://doi.org/10.1007/bf00940933openalex-snapshot
On concepts of directional differentiability
inferredcites →https://doi.org/10.1007/bf01580618openalex-snapshot
Constraint qualifications in quasidifferentiable optimization
inferredcites →https://doi.org/10.1007/bf01582256openalex-snapshot
Mathematical foundations of nonsmooth embedding methods
inferredcites →https://doi.org/10.1007/bfb0121154openalex-snapshot
Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1016/0362-546x(85)90024-0openalex-snapshot
Lipschitzian properties of multifunctions
inferredcites →https://doi.org/10.1016/0362-546x(95)91645-6openalex-snapshot
Continuous selections of linear functions and nonsmooth critical point theory
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1080/02331939108843708openalex-snapshot
On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
inferredcites →https://doi.org/10.1080/02331939108843709openalex-snapshot
A constraint qualification in quasidifferentiable programming
inferredcites →https://doi.org/10.1137/0322037openalex-snapshot
On Optimality Conditions in Quasidifferentiable Optimization
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_12openalex-snapshot
On Constraint Qualifications for Mathematical Programs with Mixed Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-00832-0_13openalex-snapshot
Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s10107-004-0539-2openalex-snapshot
Optimization problems with equilibrium constraints and their numerical solution
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.08.011openalex-snapshot
Linear semi-openness and the Lyusternik theorem
inferred← citeshttps://doi.org/10.1016/s0252-9602(08)60085-5openalex-snapshot
The Tangent cones on constraint qualifications in optimization problems
inferred← citeshttps://doi.org/10.1023/a:1004607615343openalex-snapshot
Constraint Qualifications in Nonsmooth Multiobjective Optimization
inferred← citeshttps://doi.org/10.1023/b:jota.0000037607.48762.45openalex-snapshot
On Constraint Qualifications in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/10556780008805796openalex-snapshot
On mathematical programs with complementarity constraints
inferred← citeshttps://doi.org/10.1137/s0363012996306121openalex-snapshot
Exact Penalization of Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1287/moor.24.3.627openalex-snapshot
Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1287/moor.25.1.1.15213openalex-snapshot
Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
inferred← citeshttps://doi.org/10.1287/moor.26.4.851.10007openalex-snapshot
How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
inferred← citeshttps://doi.org/10.23952/jnva.6.2022.2.06openalex-snapshot
Constraint qualifications in nonsmooth optimization: Classification and inter-relations
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.3545openalex-snapshot
Optimal control and nonlinear programming
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.983openalex-snapshot
On constraint qualifications: Motivation, design and inter-relations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.