On the public citation graph
Global saddle-point duality for quasi-concave programs, II
0 signed · 23 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-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/bf00934777openalex-snapshot
The multiplier method of Hestenes and Powell applied to convex programming
inferredcites →https://doi.org/10.1007/bf01582120openalex-snapshot
Duality theorems for certain programs involving minimum or maximum operations
inferredcites →https://doi.org/10.1007/bf01589356openalex-snapshot
Global saddle-point duality for quasi-concave programs
inferredcites →https://doi.org/10.1137/0710002openalex-snapshot
Best Rational Approximation and Strict Quasi-Convexity
inferredcites →https://doi.org/10.1137/1.9781611970548openalex-snapshot
The Theory of Best Approximation and Functional Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-25570-2_1openalex-snapshot
Unilateral Analysis and Duality
inferred← citeshttps://doi.org/10.1007/978-3-0348-9297-1_22openalex-snapshot
Duality in Generalized Fractional Programming
inferred← citeshttps://doi.org/10.1007/bf01917115openalex-snapshot
Bibliography in fractional programming
inferred← citeshttps://doi.org/10.1007/bf02591908openalex-snapshot
Duality in generalized linear fractional programming
inferred← citeshttps://doi.org/10.1016/0021-9045(84)90114-xopenalex-snapshot
Saddle-point theorems for rational approximation
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90046-iopenalex-snapshot
Duality for generalized fractional programs involving n-set functions
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90218-5openalex-snapshot
Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
inferred← citeshttps://doi.org/10.1080/02331930500138536openalex-snapshot
Multipliers and general Lagrangians
inferred← citeshttps://doi.org/10.1080/02331938808843379openalex-snapshot
Quasiconvex duality theory by generalized conjugation methods
inferred← citeshttps://doi.org/10.1080/02331938908843457openalex-snapshot
Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
inferred← citeshttps://doi.org/10.1080/02331939508844040openalex-snapshot
Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
inferred← citeshttps://doi.org/10.1080/02331939608844178openalex-snapshot
Continuous-time generalized fractional programming
inferred← citeshttps://doi.org/10.1080/09720510.1998.10700978openalex-snapshot
Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
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.