On the public citation graph

Error bounds for generalized Lagrange multipliers in locally Lipschitz programming

https://doi.org/10.1007/bf00940086
0 signed · 18 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01442544openalex-snapshot
Refinements of necessary optimality conditions in nondifferentiable programming I
inferredcites →https://doi.org/10.1007/bf01588302openalex-snapshot
On conditions to have bounded multipliers in locally lipschitz programming
inferredcites →https://doi.org/10.1007/bf01593777openalex-snapshot
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
inferredcites →https://doi.org/10.1007/bfb0120985openalex-snapshot
Refinements of necessary optimality conditions in nondifferentiable programming II
inferredcites →https://doi.org/10.1016/0167-6377(85)90030-6openalex-snapshot
Computable numerical bounds for lagrange multipliers of stationary points of non-convex differentiable non-linear programs
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-28020-0_5openalex-snapshot
Optimality Conditions. Preliminary Results
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_1openalex-snapshot
Generalized Lagrange multipliers: regularity and boundedness
inferred← citeshttps://doi.org/10.1007/bf02193099openalex-snapshot
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
inferred← citeshttps://doi.org/10.1007/s10898-016-0413-9openalex-snapshot
Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints
inferred← citeshttps://doi.org/10.1007/s10898-016-0442-4openalex-snapshot
Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1007/s10957-006-9155-zopenalex-snapshot
Necessary Optimality Conditions in Terms of Convexificators in Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/s10957-009-9644-yopenalex-snapshot
Existence and Boundedness of the Kuhn-Tucker Multipliers in Nonsmooth Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s11117-012-0201-9openalex-snapshot
Nonsmooth multiobjective programming: strong Kuhn–Tucker conditions
inferred← citeshttps://doi.org/10.1023/a:1004607615343openalex-snapshot
Constraint Qualifications in Nonsmooth Multiobjective Optimization
inferred← citeshttps://doi.org/10.1023/a:1022662120550openalex-snapshot
Stability of the Solution Set of Perturbed Nonsmooth Inequality Systems and Application
inferred← citeshttps://doi.org/10.1023/a:1022698811948openalex-snapshot
Separation of Sets, Lagrange Multipliers, and Totally Regular Extremum Problems
inferred← citeshttps://doi.org/10.1080/02331934.2017.1337763openalex-snapshot
Convexificators and boundedness of the Kuhn–Tucker multipliers set
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.