On the public citation graph

Quasi-convex duality

0 signed · 15 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.
Claim with ORCID
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.
See reference health

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-23393-8_6openalex-snapshot
Generalized Convex Duality and its Economic Applicatons
inferred← citeshttps://doi.org/10.1007/4-431-27233-x_5openalex-snapshot
The bearing of duality on microeconomics
inferred← citeshttps://doi.org/10.1007/978-3-642-56645-5_27openalex-snapshot
On Suprema of Abstract Convex and Quasi-convex Hulls
inferred← citeshttps://doi.org/10.1016/0022-247x(91)90197-8openalex-snapshot
Quasiconjugates of functions, duality relationship between Quasiconvex Minimization under a Reverse Convex Constraint and Quasiconvex Maximization under a Convex Constraint, and applications
inferred← citeshttps://doi.org/10.1016/0362-546x(83)90020-2openalex-snapshot
The lower semi-continuous quasi-convex hull as a normalized second conjugate
inferred← citeshttps://doi.org/10.1023/a:1008327614099openalex-snapshot
Duality for Anticonvex Programs
inferred← citeshttps://doi.org/10.1023/a:1013875600711openalex-snapshot
Optimization over the efficient set: overview
inferred← citeshttps://doi.org/10.1051/proc:072016openalex-snapshot
Glimpses upon quasiconvex analysis
inferred← citeshttps://doi.org/10.1080/02331930008844469openalex-snapshot
What is quasiconvex analysis?
inferred← citeshttps://doi.org/10.1080/02331930600819902openalex-snapshot
Superlinear separation for radiant and coradiant sets
inferred← citeshttps://doi.org/10.1137/0804002openalex-snapshot
A Nonconvex Duality with Zero Gap and Applications
inferred← citeshttps://doi.org/10.1137/0806012openalex-snapshot
A Generalized Convexity and Variational Inequality for Quasi-Convex Minimization
inferred← citeshttps://doi.org/10.1287/moor.15.4.597openalex-snapshot
On Quasi-Convex Duality
inferred← citeshttps://doi.org/10.70675/70c980c7z4ba9z45aczb9a3z32084b1e1b04openalex-snapshot
Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C.
inferred← citeshttps://doi.org/10.70675/9b7c2836z3e66z49efz8aa2z8c1772c8609dopenalex-snapshot
DC programming and DCA combinatorial optimization and polynomial optimization via SDP techniques
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.