On the public citation graph

Lipschitz properties of solutions in mathematical programming

0 signed · 40 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/978-1-4612-5228-3_5openalex-snapshot
The Inverse-Function Theorem
inferredcites →https://doi.org/10.1007/bf01580677openalex-snapshot
Sensitivity analysis for nonlinear programming using penalty methods
inferredcites →https://doi.org/10.1007/bf01585500openalex-snapshot
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
inferredcites →https://doi.org/10.1007/bfb0120989openalex-snapshot
Generalized equations and their solutions, part II: Applications to nonlinear programming
inferredcites →https://doi.org/10.1016/0305-0548(82)90004-1openalex-snapshot
Basic results in the development of sensitivity and stability analysis in nonlinear programming
inferredcites →https://doi.org/10.1016/b978-0-12-590240-3.50009-4openalex-snapshot
Strongly Stable Stationary Solutions in Nonlinear Programs
inferredcites →https://doi.org/10.1016/c2013-0-11385-2openalex-snapshot
Analysis and Computation of Fixed Points
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0324068openalex-snapshot
Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
inferredcites →https://doi.org/10.1287/moor.4.1.79openalex-snapshot
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
inferredcites →https://doi.org/10.1287/moor.5.1.43openalex-snapshot
Strongly Regular Generalized Equations
inferredcites →https://doi.org/10.1287/moor.9.1.87openalex-snapshot
Lipschitz Behavior of Solutions to Convex Minimization Problems
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2140/pjm.1976.64.97openalex-snapshot
On the inverse function theorem

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-4614-4538-8_1openalex-snapshot
Metric and Topological Tools
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_2openalex-snapshot
Elements of Differential Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_3openalex-snapshot
Elements of Convex Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_4openalex-snapshot
Elementary and Viscosity Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_5openalex-snapshot
Circa-Subdifferentials, Clarke Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_6openalex-snapshot
Limiting Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_7openalex-snapshot
Graded Subdifferentials, Ioffe Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4939-1037-3_2openalex-snapshot
Solution Mappings for Variational Problems
inferred← citeshttps://doi.org/10.1007/bf00939610openalex-snapshot
Necessary optimality conditions for Stackelberg problems
inferred← citeshttps://doi.org/10.1007/bf02055196openalex-snapshot
Sensitivity and stability analysis for nonlinear programming
inferred← citeshttps://doi.org/10.1007/bfb0113303openalex-snapshot
A nondifferentiable approach to the solution of optimum design problems with variational inequalities
inferred← citeshttps://doi.org/10.1007/bfb0121154openalex-snapshot
Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
inferred← citeshttps://doi.org/10.1016/0022-247x(91)90264-zopenalex-snapshot
An implicit-function theorem for C0, 1-equations and parametric C1, 1-optimization
inferred← citeshttps://doi.org/10.1016/0304-4068(93)90005-6openalex-snapshot
Existence, uniqueness and determinacy of Arrow–Debreu equilibria in finance models
inferred← citeshttps://doi.org/10.1016/0362-546x(89)90083-7openalex-snapshot
Metric regularity, openness and Lipschitzian behavior of multifunctions
inferred← citeshttps://doi.org/10.1016/j.apm.2009.04.012openalex-snapshot
A dimension-reduced method of sensitivity analysis for stochastic user equilibrium assignment model
inferred← citeshttps://doi.org/10.1023/a:1022649803808openalex-snapshot
A Proof of the Necessity of Linear Independence Condition and Strong Second-Order Sufficient Optimality Condition for Lipschitzian Stability in Nonlinear Programming
inferred← citeshttps://doi.org/10.1023/a:1023669004408openalex-snapshot
Multivalued Analysis and Differential Properties of Multivalued Mappings
inferred← citeshttps://doi.org/10.1080/01630568908816329openalex-snapshot
Convergence properties of an algorithm for solving non-differentiable optimal control problems
inferred← citeshttps://doi.org/10.1080/02331930412331330379openalex-snapshot
On the lower semicontinuity of optimal solution sets
inferred← citeshttps://doi.org/10.1080/02331938808843343openalex-snapshot
Stability Results for Stochastic Programming Problems
inferred← citeshttps://doi.org/10.1080/02331939008843557openalex-snapshot
On the Stability of Solutions in Nonlinear Programming
inferred← citeshttps://doi.org/10.1109/tempr.2025.3581089openalex-snapshot
Strategic and Fair Aggregator Interactions in Energy Markets: Multi-Agent Dynamics and Quasiconcave Games
inferred← citeshttps://doi.org/10.1137/0324068openalex-snapshot
Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
inferred← citeshttps://doi.org/10.1287/moor.16.2.292openalex-snapshot
An Implicit-Function Theorem for a Class of Nonsmooth Functions
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.