On the public citation graph

Quasidifferential calculus and first-order optimality conditions in nonsmooth optimization

https://doi.org/10.1007/bfb0121136
0 signed · 33 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/bfb0120695openalex-snapshot
Nondifferentiable Optimization
inferredcites →https://doi.org/10.1007/bfb0121134openalex-snapshot
Quasidifferentiable functions: Necessary conditions and descent directions
inferredcites →https://doi.org/10.1016/0041-5553(80)90269-4openalex-snapshot
Minimization of a quasi-differentiable function in a quasi-differentiable set
inferredcites →https://doi.org/10.1057/jors.1983.221openalex-snapshot
Progress in Nondifferentiable Optimisation
inferredcites →https://doi.org/10.1090/s0002-9939-1952-0045938-2openalex-snapshot
An Embedding Theorem for Spaces of Convex Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1137/0317019openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
inferredcites →https://doi.org/10.1137/0322037openalex-snapshot
On Optimality Conditions in Quasidifferentiable Optimization
inferredcites →https://doi.org/10.1137/0514020openalex-snapshot
On Functions Representable as a Supremum of a Family of Smooth Functions
inferredcites →https://doi.org/10.1137/0517068openalex-snapshot
On Functions Representable As a Supremum of a Family of Smooth Functions II
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2140/pjm.1959.9.707openalex-snapshot
On functions representable as a difference of convex functions
inferredcites →https://doi.org/10.2307/1402380openalex-snapshot
Introduction to Minimax
inferredcites →https://doi.org/10.2307/2005981openalex-snapshot
Introduction to Minimax
inferredcites →https://doi.org/10.2307/j.ctvcm4hcj.10openalex-snapshot
Nondifferentiable Optimization

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-26771-9_10openalex-snapshot
Generalized Lagrange Multipliers for Nonconvex Directionally Differentiable Programs
inferred← citeshttps://doi.org/10.1007/bf01580618openalex-snapshot
Constraint qualifications in quasidifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf01582061openalex-snapshot
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
inferred← citeshttps://doi.org/10.1007/bf01585754openalex-snapshot
On Shapiro's results in quasidifferential calculus
inferred← citeshttps://doi.org/10.1007/bf01586943openalex-snapshot
Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem
inferred← citeshttps://doi.org/10.1007/bfb0121133openalex-snapshot
Nonsmoothness and quasidifferentiability
inferred← citeshttps://doi.org/10.1007/s10957-016-0891-4openalex-snapshot
Positively Homogeneous Functions Revisited
inferred← citeshttps://doi.org/10.1007/s11228-019-00521-4openalex-snapshot
Metric Regularity of Quasidifferentiable Mappings and Optimality Conditions for Nonsmooth Mathematical Programming Problems
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50004-1openalex-snapshot
Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1080/02331938908843481openalex-snapshot
The quasidifferential of an optimal value function in nonsmooth programming
inferred← citeshttps://doi.org/10.1080/02331939008843530openalex-snapshot
Upper DSL Approximates and Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/02331939108843709openalex-snapshot
A constraint qualification in quasidifferentiable programming
inferred← citeshttps://doi.org/10.1080/02331939208843794openalex-snapshot
On Quasidifferentiable Functions and Non-Differentiable Programming
inferred← citeshttps://doi.org/10.1080/02522667.1992.10699122openalex-snapshot
Optimality conditions in quasidifferentiable mathematical programming
inferred← citeshttps://doi.org/10.1137/19m1293478openalex-snapshot
A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials
inferred← citeshttps://doi.org/10.1287/moor.20.4.818openalex-snapshot
Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
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.