On the public citation graph
Invex-convexlike functions and duality
0 signed · 28 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/bf00939737openalex-snapshot
Zero duality gaps in infinite-dimensional programming
inferredcites →https://doi.org/10.1007/bf00939770openalex-snapshot
On necessary optimality conditions in vector optimization problems
inferredcites →https://doi.org/10.1007/bf00939804openalex-snapshot
On necessary and sufficient conditions in vector optimization
inferredcites →https://doi.org/10.1007/bf00939895openalex-snapshot
Proper solutions of vector optimization problems
inferredcites →https://doi.org/10.1007/bf02591683openalex-snapshot
Necessary and sufficient conditions in constrained optimization
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(88)90113-8openalex-snapshot
Pre-invex functions in multiple objective optimization
inferredcites →https://doi.org/10.1017/s1446788700022126openalex-snapshot
Invex functions and duality
inferredcites →https://doi.org/10.1080/01630568908816337openalex-snapshot
A modified wolfe dual for weak vector minimization
inferredcites →https://doi.org/10.1080/01630568908816352openalex-snapshot
Generalized invexity for nonsmooth vector-valued mappings
inferredcites →https://doi.org/10.1080/01630569108816453openalex-snapshot
Invex multifunctions and duality
inferredcites →https://doi.org/10.1080/02331938508843061openalex-snapshot
Convexlike alternative theorems and 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.1006/jmaa.1999.6284openalex-snapshot
Generalized Convexity in Multiobjective Programming
inferred← citeshttps://doi.org/10.1006/jmaa.1999.6484openalex-snapshot
Invexity and the Kuhn–Tucker Theorem
inferred← citeshttps://doi.org/10.1007/0-387-23393-8_4openalex-snapshot
Generalized Convexity and Optimality Conditions in Scalar and Vector Optimization
inferred← citeshttps://doi.org/10.1007/bf02192569openalex-snapshot
Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions
inferred← citeshttps://doi.org/10.1007/s10898-011-9794-yopenalex-snapshot
Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
inferred← citeshttps://doi.org/10.1007/s11590-013-0626-5openalex-snapshot
On the optimization properties of the correntropic loss function in data analysis
inferred← citeshttps://doi.org/10.1007/s40324-023-00344-2openalex-snapshot
Set-valued parametric optimization problems with higher-order $$\rho $$-cone arcwise connectedness
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.01.024openalex-snapshot
Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
inferred← citeshttps://doi.org/10.1016/j.na.2010.06.019openalex-snapshot
Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints
inferred← citeshttps://doi.org/10.1023/a:1009753224825openalex-snapshot
On Duality in Nonconvex Vector Optimization in Banach Spaces Using Augmented Lagrangians
inferred← citeshttps://doi.org/10.1186/s13660-022-02792-2openalex-snapshot
Using ρ-cone arcwise connectedness on parametric set-valued optimization problems
inferred← citeshttps://doi.org/10.32508/stdjet.v4isi2.916openalex-snapshot
Optimality conditions and duality with new variants of generalized derivatives and convexity
inferred← citeshttps://doi.org/10.58250/jnanabha.2021.51101openalex-snapshot
PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
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.