On the public citation graph
Perfect duality for convexlike programs
0 signed · 66 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/bf00930578openalex-snapshot
Nonlinear programming in Banach spaces
inferredcites →https://doi.org/10.1007/bf01584656openalex-snapshot
Convex analysis treated by linear programming
inferredcites →https://doi.org/10.1007/bf01588327openalex-snapshot
A note on perfect duality and limiting lagrangeans
inferredcites →https://doi.org/10.1007/bfb0006581openalex-snapshot
Optimality conditions for some nonconvex problems
inferredcites →https://doi.org/10.1073/pnas.72.5.1778openalex-snapshot
Lagrange Multiplier Method for Convex Programs
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.5566openalex-snapshot
Infinite programming and theorems of the alternative
inferred← citeshttps://doi.org/10.1007/0-387-25570-2_1openalex-snapshot
Unilateral Analysis and Duality
inferred← citeshttps://doi.org/10.1007/0-387-26771-9_10openalex-snapshot
Generalized Lagrange Multipliers for Nonconvex Directionally Differentiable Programs
inferred← citeshttps://doi.org/10.1007/978-1-4419-9640-4_5openalex-snapshot
A Derivative for Semipreinvex Functions and Its Applications in Semipreinvex Programming
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/bf00940897openalex-snapshot
Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
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/bf03398587openalex-snapshot
Theorems of the Alternative for Multifunctions
inferred← citeshttps://doi.org/10.1007/bf03398615openalex-snapshot
Arcwise Cone Connected Functions and Optimality
inferred← citeshttps://doi.org/10.1007/bf03398686openalex-snapshot
Saddle-Point Type Optimality Criteria for Optimization Problem over Cones
inferred← citeshttps://doi.org/10.1007/bf03399224openalex-snapshot
Saddle-Point Type Optimality Criteria and Duality Relations for Generalized Fractional Programming
inferred← citeshttps://doi.org/10.1007/bfb0076702openalex-snapshot
Non-linear separation theorems, duality and optimality conditions
inferred← citeshttps://doi.org/10.1007/s10898-015-0379-zopenalex-snapshot
A sharp Lagrange multiplier theorem for nonlinear programs
inferred← citeshttps://doi.org/10.1007/s10957-004-1712-8openalex-snapshot
Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/s10957-007-9221-1openalex-snapshot
Lagrangian Duality and Cone Convexlike Functions
inferred← citeshttps://doi.org/10.1007/s10957-016-0959-1openalex-snapshot
Nonlinear Programming via König’s Maximum Theorem
inferred← citeshttps://doi.org/10.1007/s11228-022-00641-4openalex-snapshot
Theorems of the Alternative Revisited and Some Extensions of Yuan’s Lemma
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-012-0092-3openalex-snapshot
Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
inferred← citeshttps://doi.org/10.1007/s12597-015-0214-9openalex-snapshot
Optimality and duality in vector optimization problems involving arcwise connected d-type-I functions over cones
inferred← citeshttps://doi.org/10.1007/s12597-023-00670-zopenalex-snapshot
Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality
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/0893-9659(96)00020-1openalex-snapshot
Convexity for set-valued maps
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/j.jmaa.2017.06.007openalex-snapshot
Revisiting the Hahn–Banach theorem and nonlinear infinite programming
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.1017/s0004972700038983openalex-snapshot
Semilocal E-convexity and semilocal E-convex programming
inferred← citeshttps://doi.org/10.1023/a:1004641726264openalex-snapshot
On Convex Generalized Systems
inferred← citeshttps://doi.org/10.1023/a:1004659732181openalex-snapshot
Generalized Connected Functions with Respect to Cones
inferred← citeshttps://doi.org/10.1023/a:1021780423989openalex-snapshot
On Classes of Generalized Convex Functions, Gordan–Farkas Type Theorems, and Lagrangian Duality
inferred← citeshttps://doi.org/10.1023/a:1021781308794openalex-snapshot
Theorems of the Alternative and Optimality Conditions for Convexlike and General Convexlike Programming
inferred← citeshttps://doi.org/10.1023/a:1022614029984openalex-snapshot
Dominating Sets for Convex Functions with Some Applications
inferred← citeshttps://doi.org/10.1023/a:1022658019642openalex-snapshot
Lagrangian Duality for Minimization of Nonconvex Multifunctions
inferred← citeshttps://doi.org/10.1023/a:1025451422581openalex-snapshot
Arcwise Connected Cone-Convex Functions and Mathematical Programming
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/02331930008844504openalex-snapshot
Invex nonsmooth alternative theorem and applications*
inferred← citeshttps://doi.org/10.1080/02331934.2010.505651openalex-snapshot
Image space approach and subdifferentials of integral functionals
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/02331939308843891openalex-snapshot
Nondifferentiable optimization in banach space
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.1142/9789812798862_0007openalex-snapshot
IMAGES, SEPARATION OF SETS AND EXTREMUM PROBLEMS
inferred← citeshttps://doi.org/10.1155/2009/898213openalex-snapshot
Optimality Conditions of Globally Efficient Solution for Vector Equilibrium Problems with Generalized Convexity
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.11650/tjm.17.2013.1935openalex-snapshot
LAGRANGIAN DUALITY FOR VECTOR OPTIMIZATION PROBLEM WITH SET-VALUED MAPPINGS
inferred← citeshttps://doi.org/10.1360/n012019-00042openalex-snapshot
The linear scalarizations and Lagrange multipliers for vector optimization
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
inferred← citeshttps://doi.org/10.68381/jca04005openalex-snapshot
A Systematization of Convexity Concepts for Sets and 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.