On the public citation graph
A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
0 signed · 39 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-94-009-5796-1openalex-snapshot
Mathematical Programming and Control Theory
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/bfb0120983openalex-snapshot
Characterizations of optimality without constraint qualification for the abstract convex program
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/s0004972700009400openalex-snapshot
The Farkas lemma of Shimizu, Aiyoshi and Katayama
inferredcites →https://doi.org/10.1080/00036818008839319openalex-snapshot
Complete characterization of optimality for convex programming in banach spaces†
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/1.9781611970524openalex-snapshot
Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611970524.ch1openalex-snapshot
1. Conjugate Duality and Optimization
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
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.1997.5612openalex-snapshot
Further Generalizations of Farkas' Theorem and Their Applications in Optimal Control
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/bf01582061openalex-snapshot
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
inferred← citeshttps://doi.org/10.1007/bf02191763openalex-snapshot
Connectedness of efficient solution sets for set-valued maps in normed spaces
inferred← citeshttps://doi.org/10.1007/s10957-006-9140-6openalex-snapshot
Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11117-005-0042-xopenalex-snapshot
Necessary and Sufficient Conditions for Solving Infinite-Dimensional Linear Inequalities
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(91)90221-kopenalex-snapshot
Inequality systems and optimization
inferred← citeshttps://doi.org/10.1016/0362-546x(90)90047-kopenalex-snapshot
Duality and infinite dimensional optimization
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.1023/a:1022606002804openalex-snapshot
Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701053openalex-snapshot
Farkas theorems for positively homogeneous quasiconvex functions
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.2991/icemct-15.2015.252openalex-snapshot
Necessary Optimality Condition for Vector Optimization Problems in Infinite-dimensional Linear Spaces
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.48550/arxiv.1709.04892openalex-snapshot
Saddle-point theorems for the generalized cone-convex optimizations of set-valued 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.