On the public citation graph
Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
0 signed · 36 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/bf00933162openalex-snapshot
On functions whose stationary points are global minima
inferredcites →https://doi.org/10.1007/bf00939543openalex-snapshot
Note on generalized convex functions
inferredcites →https://doi.org/10.1016/0022-247x(81)90123-2openalex-snapshot
On sufficiency of the Kuhn-Tucker conditions
inferredcites →https://doi.org/10.1016/0022-247x(89)90339-9openalex-snapshot
On generalized pseudoconvex functions
inferredcites →https://doi.org/10.1016/0362-546x(85)90024-0openalex-snapshot
Lipschitzian properties of multifunctions
inferredcites →https://doi.org/10.1017/s0004972700012491openalex-snapshot
On locally Lipschitz vector-valued invex functions
inferredcites →https://doi.org/10.1017/s1446788700022126openalex-snapshot
Invex functions and duality
inferredcites →https://doi.org/10.1017/s1446788700028081openalex-snapshot
On quasidifferentiable optimization
inferredcites →https://doi.org/10.1080/01630568908816352openalex-snapshot
Generalized invexity for nonsmooth vector-valued mappings
inferredcites →https://doi.org/10.1080/01630569108816436openalex-snapshot
Invexity in multifunction optimization
inferredcites →https://doi.org/10.1080/01630569108816453openalex-snapshot
Invex multifunctions and duality
inferredcites →https://doi.org/10.1080/01630569408816555openalex-snapshot
Generalized invexity and duality theories with multifunctions
inferredcites →https://doi.org/10.1080/02331939208843804openalex-snapshot
On the notion of tangent cone in mathematical programming
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1137/1015075openalex-snapshot
A Review of Constraint Qualifications in Finite-Dimensional Spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-30324-1_10openalex-snapshot
Introduction to Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-85671-9openalex-snapshot
Generalized Convexity and Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10114-007-5649-3openalex-snapshot
Existence of weakly efficient solutions in vector optimization
inferred← citeshttps://doi.org/10.1007/s10203-022-00375-wopenalex-snapshot
Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
inferred← citeshttps://doi.org/10.1007/s10898-004-0998-2openalex-snapshot
Generalized Convexity and Nonsmooth Problems of Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10898-007-9168-7openalex-snapshot
Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
inferred← citeshttps://doi.org/10.1007/s11590-014-0801-3openalex-snapshot
On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
inferred← citeshttps://doi.org/10.1007/s11590-015-0850-2openalex-snapshot
Vector critical points and efficiency in vector optimization with Lipschitz functions
inferred← citeshttps://doi.org/10.1016/j.amc.2007.11.027openalex-snapshot
Existence of weakly efficient solutions in nonsmooth vector optimization
inferred← citeshttps://doi.org/10.1017/s1446181100013547openalex-snapshot
Efficiency and generalised convexity in vector optimisation problems
inferred← citeshttps://doi.org/10.1023/a:1021769232224openalex-snapshot
Optimally Conditions for Pareto Nonsmooth Nonconvex Programming in Banach Spaces
inferred← citeshttps://doi.org/10.1023/a:1024698418606openalex-snapshot
Infine Functions, Nonsmooth Alternative Theorems and Vector Optimization Problems
inferred← citeshttps://doi.org/10.1023/b:jogo.0000047911.03061.88openalex-snapshot
Duality in Vector Optimization in Banach Spaces with Generalized Convexity
inferred← citeshttps://doi.org/10.1080/01630560802418409openalex-snapshot
Duality in Vector Optimization Under Type 1 α-Invexity in Banach Spaces
inferred← citeshttps://doi.org/10.1080/02331930008844504openalex-snapshot
Invex nonsmooth alternative theorem and applications*
inferred← citeshttps://doi.org/10.1080/02331930701763645openalex-snapshot
Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
inferred← citeshttps://doi.org/10.1080/02331930802434823openalex-snapshot
Optimality conditions for non-smooth semi-infinite programming
inferred← citeshttps://doi.org/10.1155/ijmms/2006/26808openalex-snapshot
Some relations between variational‐like inequalities and efficientsolutions of certain nonsmooth optimization problems
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-3162openalex-snapshot
Properly efficient solutions to non-differentiable multiobjective optimization problems
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.