On the public citation graph
Exact quasiconvex conjugation
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.1007/978-3-642-48298-4_4openalex-snapshot
Conjugacy in quasiconvex analysis
inferredcites →https://doi.org/10.1090/pspum/007/0154186openalex-snapshot
Semispaces and the topology of convexivity
inferredcites →https://doi.org/10.1137/0316018openalex-snapshot
On $\Phi $-Convexity in Extremal Problems
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-1-4684-7600-2_10openalex-snapshot
Supplementary Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_14openalex-snapshot
Duality theory for convex/quasiconvex functions and its application to optimization
inferred← citeshttps://doi.org/10.1007/bf01581192openalex-snapshot
A duality approach to minimax results for quasi-saddle functions in finite dimensions
inferred← citeshttps://doi.org/10.1007/bf02310300openalex-snapshot
Classification of semispaces according to their types in infinite-dimensional vector spaces
inferred← citeshttps://doi.org/10.1007/bf02591881openalex-snapshot
Conjugacy in quasi-convex programming
inferred← citeshttps://doi.org/10.1007/bfb0008893openalex-snapshot
Lexicographical order, inequality systems and optimization
inferred← citeshttps://doi.org/10.1007/s10898-013-0097-3openalex-snapshot
Motzkin predecomposable sets
inferred← citeshttps://doi.org/10.1007/s10957-013-0395-4openalex-snapshot
Duality for Closed Convex Functions and Evenly Convex Functions
inferred← citeshttps://doi.org/10.1007/s11117-015-0327-7openalex-snapshot
Level sets relaxation, epigraphical relaxation and conditioning in optimization
inferred← citeshttps://doi.org/10.1016/0024-3795(83)90135-0openalex-snapshot
The structure of hemispaces in Rn
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90312-0openalex-snapshot
Lexicographical separation in Rn
inferred← citeshttps://doi.org/10.1016/0024-3795(90)90283-iopenalex-snapshot
Lexicographical order, lexicographical index, and linear operators
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90209-fopenalex-snapshot
Compatible preorders and linear operators on Rn
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90178-6openalex-snapshot
Lexicographical order and duality in multiobjective programming
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.10.011openalex-snapshot
Lexicographic choice functions
inferred← citeshttps://doi.org/10.1016/j.jmaa.2012.10.072openalex-snapshot
Motzkin decomposition of closed convex sets via truncation
inferred← citeshttps://doi.org/10.1016/j.jmaa.2016.06.073openalex-snapshot
Closed convex sets of Minkowski type
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)00003-2openalex-snapshot
On φ-convexity of convex functions
inferred← citeshttps://doi.org/10.1080/01630568708816247openalex-snapshot
Surrogate duality for vector optimization
inferred← citeshttps://doi.org/10.1080/02331934.2023.2282175openalex-snapshot
Conic cancellation laws and some applications in set optimization
inferred← citeshttps://doi.org/10.1080/02331938808843379openalex-snapshot
Quasiconvex duality theory by generalized conjugation methods
inferred← citeshttps://doi.org/10.17398/2605-5686.36.2.241openalex-snapshot
Support and separation properties of convex sets in finite dimension
inferred← citeshttps://doi.org/10.4213/mzm1385openalex-snapshot
Классификация полупространств по типам в бесконечномерных векторных пространствах
inferred← citeshttps://doi.org/10.68381/jca19026openalex-snapshot
Lexicographical Representation of Convex Sets
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.