On the public citation graph
Nonlinear alternative theorems and nondifferentiable programming
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.1007/978-1-4684-9369-6openalex-snapshot
Geometric Functional Analysis and its Applications
inferredcites →https://doi.org/10.1007/978-3-642-48294-6openalex-snapshot
Foundations of Optimization
inferredcites →https://doi.org/10.1007/978-94-009-5796-1openalex-snapshot
Mathematical Programming and Control Theory
inferredcites →https://doi.org/10.1007/bf00933349openalex-snapshot
On the existence and nonexistence of Lagrange multipliers in Banach spaces
inferredcites →https://doi.org/10.1007/bf00933524openalex-snapshot
An application of Guignard's generalized Kuhn-Tucker conditions
inferredcites →https://doi.org/10.1007/bf00934593openalex-snapshot
Another application of Guignard's generalized Kuhn-Tucker conditions
inferredcites →https://doi.org/10.1007/bf00934807openalex-snapshot
Nonlinear programming in locally convex spaces
inferredcites →https://doi.org/10.1007/bf01442543openalex-snapshot
Regularity and stability for the mathematical programming problem in Banach spaces
inferredcites →https://doi.org/10.1007/bf01917106openalex-snapshot
A generalized Farkas lemma with applications to quasidifferentiable programming
inferredcites →https://doi.org/10.1007/bfb0004508openalex-snapshot
On the existence of Lagrange multipliers in nonlinear programming in Banach spaces
inferredcites →https://doi.org/10.1007/bfb0120983openalex-snapshot
Characterizations of optimality without constraint qualification for the abstract convex program
inferredcites →https://doi.org/10.1016/0022-247x(74)90282-0openalex-snapshot
Infinite programming and duality in topological vector spaces
inferredcites →https://doi.org/10.1016/0022-247x(74)90289-3openalex-snapshot
A class of nondifferentiable mathematical programming problems
inferredcites →https://doi.org/10.1016/0022-247x(78)90260-3openalex-snapshot
A generalization of the Farkas lemma and applications to convex programming
inferredcites →https://doi.org/10.1017/s1446788700024927openalex-snapshot
Duality theorems and an optimality condition for non-differentiable convex programming
inferredcites →https://doi.org/10.1017/s1446788700028081openalex-snapshot
On quasidifferentiable optimization
inferredcites →https://doi.org/10.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
inferredcites →https://doi.org/10.1080/01630568008816074openalex-snapshot
On an abstract control problem
inferredcites →https://doi.org/10.1080/01630568208816122openalex-snapshot
Asymptotic kuhn-tucker conditions in abstract spaces
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0313769-9openalex-snapshot
Normed Convex Processes
inferredcites →https://doi.org/10.1137/0121047openalex-snapshot
Extensions of Asymptotic Kuhn–Tucker Conditions in Mathematical 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/bf00938544openalex-snapshot
Farkas' theorem of nonconvex type and its application to a min-max problem
inferred← citeshttps://doi.org/10.1007/bf00941180openalex-snapshot
A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
inferred← citeshttps://doi.org/10.1007/bf01582061openalex-snapshot
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
inferred← citeshttps://doi.org/10.1007/s11590-009-0133-xopenalex-snapshot
Farkas’ lemma for separable sublinear inequalities without qualifications
inferred← citeshttps://doi.org/10.1017/s0004972700013265openalex-snapshot
Nondifferentiable programming and duality with modified convexity
inferred← citeshttps://doi.org/10.1080/01630569608816697openalex-snapshot
Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
inferred← citeshttps://doi.org/10.1080/02331938708843228openalex-snapshot
Nonconvex theorems of the alternative and minimization
inferred← citeshttps://doi.org/10.1080/02331939208843794openalex-snapshot
On Quasidifferentiable Functions and Non-Differentiable Programming
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.