On the public citation graph
Optimality conditions for some nonconvex problems
0 signed · 32 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.1002/mana.19780810116openalex-snapshot
Necessary and Sufficient Conditions for the Order‐ Completeness of Partially Ordered Vector Spaces
inferredcites →https://doi.org/10.1002/mana.19780840119openalex-snapshot
Some General Separation Theorems
inferredcites →https://doi.org/10.1002/mana.19800970115openalex-snapshot
Separation of Two Sets in a Product Space
inferredcites →https://doi.org/10.1002/mana.3210620111openalex-snapshot
Ein Bipolarensatz Dem 25. Jahrestag der DDR gewidmet
inferredcites →https://doi.org/10.1007/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1080/02331937808842491openalex-snapshot
Recent results on separation of convex sets1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00934081openalex-snapshot
Perfect duality for convexlike programs
inferred← citeshttps://doi.org/10.1007/bf00938802openalex-snapshot
On the image of a constrained extremum problem and some applications to the existence of a minimum
inferred← citeshttps://doi.org/10.1007/bf02191781openalex-snapshot
Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
inferred← citeshttps://doi.org/10.1007/bf02564830openalex-snapshot
Multiobjective fractional programming with generalized convexity
inferred← citeshttps://doi.org/10.1007/bfb0076702openalex-snapshot
Non-linear separation theorems, duality and optimality conditions
inferred← citeshttps://doi.org/10.1007/s11590-008-0099-0openalex-snapshot
On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
inferred← citeshttps://doi.org/10.1007/s12597-024-00857-yopenalex-snapshot
On efficiency conditions for nonsmooth multiobjective fractional bilevel programming with non-locally Lipschitz functions
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90113-8openalex-snapshot
Pre-invex functions in multiple objective optimization
inferred← citeshttps://doi.org/10.1016/j.camwa.2003.05.013openalex-snapshot
Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.02.032openalex-snapshot
Multiple objective fractional programming involving semilocally type I-preinvex and related functions
inferred← citeshttps://doi.org/10.1016/s0022-247x(02)00460-2openalex-snapshot
Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions
inferred← citeshttps://doi.org/10.1017/s0004972700027441openalex-snapshot
A class of nonconvex functions and mathematical programming
inferred← citeshttps://doi.org/10.1023/a:1004641726264openalex-snapshot
On Convex Generalized Systems
inferred← citeshttps://doi.org/10.1023/a:1021725200423openalex-snapshot
Optimality Conditions and Duality Involving Arcwise Connected and Generalized Arcwise Connected Functions
inferred← citeshttps://doi.org/10.1051/cocv/2018012openalex-snapshot
Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems
inferred← citeshttps://doi.org/10.1051/ro/2014046openalex-snapshot
Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity
inferred← citeshttps://doi.org/10.1080/02331938508843061openalex-snapshot
Convexlike alternative theorems and mathematical programming
inferred← citeshttps://doi.org/10.1080/02331938708843228openalex-snapshot
Nonconvex theorems of the alternative and minimization
inferred← citeshttps://doi.org/10.1080/02331939608844179openalex-snapshot
Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
inferred← citeshttps://doi.org/10.1080/02522667.2020.1840101openalex-snapshot
Mond-Weir duality under ρ -(η, θ) -invexity in Banach space
inferred← citeshttps://doi.org/10.1155/2012/629194openalex-snapshot
A Class of Semilocal E‐Preinvex Functions and Its Applications in Nonlinear Programming
inferred← citeshttps://doi.org/10.1155/2014/496149openalex-snapshot
Multiobjective Fractional Programming Involving Generalized Semilocally V-Type I-Preinvex and Related Functions
inferred← citeshttps://doi.org/10.1155/2014/750910openalex-snapshot
Interval-Valued Optimization Problems Involving α,ρ -Right Upper-Dini-Derivative Functions
inferred← citeshttps://doi.org/10.18576/amis/100313openalex-snapshot
Weak Pseudo-Invexity and Characterizations of Solutions in Multiobjective Programming
inferred← citeshttps://doi.org/10.4134/ckms.2012.27.2.411openalex-snapshot
OPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX AND RELATED FUNCTIONS
inferred← citeshttps://doi.org/10.4236/am.2013.44101openalex-snapshot
A Note on the Guignard Constraint Qualification and the Guignard Regularity Condition in Vector Optimization
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.