On the public citation graph
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
0 signed · 55 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.1006/jmaa.1993.1368openalex-snapshot
A Solvability Theorem for a Class of Quasiconvex Mappings with Applications to Optimization
inferredcites →https://doi.org/10.1007/978-94-009-5796-1openalex-snapshot
Mathematical Programming and Control Theory
inferredcites →https://doi.org/10.1007/bf00941180openalex-snapshot
A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
inferredcites →https://doi.org/10.1007/bf01218398openalex-snapshot
Correction: On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints
inferredcites →https://doi.org/10.1007/bf01447734openalex-snapshot
On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints
inferredcites →https://doi.org/10.1007/bf01460130openalex-snapshot
Optimality conditions in nondifferentiable programming and their applications to best approximations
inferredcites →https://doi.org/10.1007/bf01588791openalex-snapshot
Quasidifferentials and maximal normal operators
inferredcites →https://doi.org/10.1007/bf01917106openalex-snapshot
A generalized Farkas lemma with applications to quasidifferentiable programming
inferredcites →https://doi.org/10.1007/bf01920919openalex-snapshot
Nonlinear alternative theorems and nondifferentiable programming
inferredcites →https://doi.org/10.1007/bfb0121133openalex-snapshot
Nonsmoothness and quasidifferentiability
inferredcites →https://doi.org/10.1007/bfb0121136openalex-snapshot
Quasidifferential calculus and first-order optimality conditions in nonsmooth optimization
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.1016/0022-247x(91)90221-kopenalex-snapshot
Inequality systems and optimization
inferredcites →https://doi.org/10.1017/s1446788700028081openalex-snapshot
On quasidifferentiable optimization
inferredcites →https://doi.org/10.1080/01630568208816122openalex-snapshot
Asymptotic kuhn-tucker conditions in abstract spaces
inferredcites →https://doi.org/10.1080/01630568708816246openalex-snapshot
On optimality conditions in nonsmooth inequality constrained minimization
inferredcites →https://doi.org/10.1080/02331939108843708openalex-snapshot
On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
inferredcites →https://doi.org/10.1080/02331939108843709openalex-snapshot
A constraint qualification in quasidifferentiable programming
inferredcites →https://doi.org/10.1080/02331939208843794openalex-snapshot
On Quasidifferentiable Functions and Non-Differentiable Programming
inferredcites →https://doi.org/10.1137/0713043openalex-snapshot
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jmaa.2000.7263openalex-snapshot
Nonsmooth Invex Functions and Sufficient Optimality Conditions
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/978-3-540-37007-9_17openalex-snapshot
On the Work of W. Oettli in Generalized Convexity and Nonconvex Optimization — a Review and Some Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_16openalex-snapshot
Abstract nonsmooth nonconvex programming
inferred← citeshttps://doi.org/10.1007/bf00138691openalex-snapshot
Characterizing global optimality for DC optimization problems under convex inequality constraints
inferred← citeshttps://doi.org/10.1007/s10107980013aopenalex-snapshot
Dual conditions characterizing optimality for convex multi-objective programs
inferred← citeshttps://doi.org/10.1007/s10479-025-06627-3openalex-snapshot
On quasidifferentiable interval-valued multiobjective optimization
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.1007/s40995-022-01309-2openalex-snapshot
On Quasidifferentiable Multiobjective Fractional Programming
inferred← citeshttps://doi.org/10.1016/0362-546x(94)90104-xopenalex-snapshot
Solvability theorems for classes of difference convex functions
inferred← citeshttps://doi.org/10.1016/0893-9659(93)90097-7openalex-snapshot
A new version of Farkas' lemma and global convex maximization
inferred← citeshttps://doi.org/10.1016/j.na.2007.09.014openalex-snapshot
On constraint qualifications in nonlinear programming
inferred← citeshttps://doi.org/10.1017/s0004972700015227openalex-snapshot
Locally compactly Lipschitzian mappings in infinite dimensional programming
inferred← citeshttps://doi.org/10.1023/a:1018953607589openalex-snapshot
A class of constraint qualifications in nonsmooth 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/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/09720510.2002.10701053openalex-snapshot
Farkas theorems for positively homogeneous quasiconvex functions
inferred← citeshttps://doi.org/10.1080/10556780108805831openalex-snapshot
On theorems of the alternative
inferred← citeshttps://doi.org/10.1080/10556788.2022.2119235openalex-snapshot
On minty variational principle for quasidifferentiable vector optimization problems
inferred← citeshttps://doi.org/10.1137/030602332openalex-snapshot
Farkas-Type Results With Conjugate Functions
inferred← citeshttps://doi.org/10.1137/0806021openalex-snapshot
Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
inferred← citeshttps://doi.org/10.1137/1036001openalex-snapshot
An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
inferred← citeshttps://doi.org/10.1137/130911287openalex-snapshot
Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
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.1137/s0363012994268321openalex-snapshot
A Farkas lemma Without A Standard Closure Condition
inferred← citeshttps://doi.org/10.1137/s1052623402401944openalex-snapshot
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex 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.4064/sm-117-2-123-136openalex-snapshot
Open mapping theorem and inversion theorem for γ-paraconvex multivalued mappings and applications
inferred← citeshttps://doi.org/10.7153/mia-13-10openalex-snapshot
Farkas-Type results for general composed convex optimization problems with inequality constraints
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.