On the public citation graph

A generalized Farkas lemma with applications to quasidifferentiable programming

https://doi.org/10.1007/bf01917106
0 signed · 47 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-94-009-5796-1openalex-snapshot
Mathematical Programming and Control Theory
inferredcites →https://doi.org/10.1007/bf00934593openalex-snapshot
Another application of Guignard's generalized Kuhn-Tucker conditions
inferredcites →https://doi.org/10.1007/bf01580396openalex-snapshot
Fractional programming without differentiability
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/bfb0059450openalex-snapshot
A Course on Optimization and Best Approximation
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.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
inferredcites →https://doi.org/10.1137/1.9781611970524.ch1openalex-snapshot
1. Conjugate Duality and Optimization
inferredcites →https://doi.org/10.2307/2005191openalex-snapshot
Necessary Conditions for an Extremum

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-306-48332-7_133openalex-snapshot
Farkas lemmaFarkas lemma; Fourier–Motzkin elimination method; Fractional programming; Global optimization: Envelope representation; Gröbner bases for polynomial equations; Lagrangian duality: Basics; Least-index anticycling rules; Theorems of the alternative and optimizationFARKAS LEMMA:…
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_176openalex-snapshot
Farkas Lemma: Generalizations
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_1openalex-snapshot
An Introduction to Quasidifferential Calculus
inferred← citeshttps://doi.org/10.1007/bf00938589openalex-snapshot
Norm duality for convex processes and applications
inferred← citeshttps://doi.org/10.1007/bf00939083openalex-snapshot
Theorems of the alternative for multifunctions with applications to optimization: General results
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/bf01259338openalex-snapshot
Solvability results for sublinear functions and operators
inferred← citeshttps://doi.org/10.1007/bf01582061openalex-snapshot
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
inferred← citeshttps://doi.org/10.1007/bf01920919openalex-snapshot
Nonlinear alternative theorems and nondifferentiable programming
inferred← citeshttps://doi.org/10.1007/bfb0005666openalex-snapshot
Optimality conditions and duality for continuous time programming without differentiability
inferred← citeshttps://doi.org/10.1007/s10107-007-0104-xopenalex-snapshot
Complete characterizations of stable Farkas’ lemma and cone-convex programming duality
inferred← citeshttps://doi.org/10.1007/s11590-009-0133-xopenalex-snapshot
Farkas’ lemma for separable sublinear inequalities without qualifications
inferred← citeshttps://doi.org/10.1007/s11750-014-0319-yopenalex-snapshot
Farkas’ lemma: three decades of generalizations for mathematical optimization
inferred← citeshttps://doi.org/10.1016/0022-247x(86)90280-5openalex-snapshot
Nonasymptotic necessary conditions for nonsmooth infinite optimization problems
inferred← citeshttps://doi.org/10.1017/s0004972700001908openalex-snapshot
Generalized convexity in nondifferentiable programming
inferred← citeshttps://doi.org/10.1017/s0004972700009400openalex-snapshot
The Farkas lemma of Shimizu, Aiyoshi and Katayama
inferred← citeshttps://doi.org/10.1017/s1446788700022126openalex-snapshot
Invex functions and duality
inferred← citeshttps://doi.org/10.1017/s1446788700028081openalex-snapshot
On quasidifferentiable optimization
inferred← citeshttps://doi.org/10.1023/a:1022606002804openalex-snapshot
Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
inferred← citeshttps://doi.org/10.1080/00029890.2025.2583872openalex-snapshot
The Intermediate Value Theorem for Linear Transformations
inferred← citeshttps://doi.org/10.1080/01630568208816122openalex-snapshot
Asymptotic kuhn-tucker conditions in abstract spaces
inferred← citeshttps://doi.org/10.1080/01630568708816244openalex-snapshot
Results of farkas type
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/02331930500342716openalex-snapshot
Optimization with generalized invexity
inferred← citeshttps://doi.org/10.1080/02331934.2017.1394296openalex-snapshot
Optimality conditions for the simple convex bilevel programming problem in Banach spaces
inferred← citeshttps://doi.org/10.1080/02331938308842884openalex-snapshot
Differentiable Programming in Banach Spaces
inferred← citeshttps://doi.org/10.1080/02331938508843025openalex-snapshot
On a theorem of Ky Fan and its application to nondifferentiame optimization
inferred← citeshttps://doi.org/10.1080/02331938608843097openalex-snapshot
Nondifferentiable optimization by smooth approximations
inferred← citeshttps://doi.org/10.1080/02331939208843794openalex-snapshot
On Quasidifferentiable Functions and Non-Differentiable Programming
inferred← citeshttps://doi.org/10.1080/02331939708844283openalex-snapshot
Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef:
inferred← citeshttps://doi.org/10.1080/10652469608819102openalex-snapshot
A generl farkas type lemma
inferred← citeshttps://doi.org/10.1137/16m107637xopenalex-snapshot
Optimal Control Problems with Terminal Complementarity Constraints
inferred← citeshttps://doi.org/10.1287/moor.20.4.818openalex-snapshot
Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
inferred← citeshttps://doi.org/10.4171/zaa/317openalex-snapshot
Necessary Optimality Conditions for Nonsmooth Problems with Operator Constraints
inferred← citeshttps://doi.org/10.68381/jca02021openalex-snapshot
A General Approach to Dual Characterizations of Solvability of Inequality Systems with Applications
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.