On the public citation graph
A note on perfect duality and limiting lagrangeans
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/zamm.19790590621openalex-snapshot
Ekeland, I. / Temam, R., Convex Analysis and Variational Problems. Amsterdam‐Oxford. North‐Holland Publ. Company. 1976. IX, 402 S., Dfl. 85.00. US $ 29.50 (SMAA 1)
inferredcites →https://doi.org/10.1007/bf00935754openalex-snapshot
A limiting Lagrangian for infinitely constrained convex optimization inR n
inferredcites →https://doi.org/10.1007/bf01448186openalex-snapshot
Constructing a perfect duality in infinite programming
inferredcites →https://doi.org/10.1007/bf01584656openalex-snapshot
Convex analysis treated by linear programming
inferredcites →https://doi.org/10.1007/bfb0120920openalex-snapshot
Lagrangean functions and affine minorants
inferredcites →https://doi.org/10.1016/c2009-0-19672-1openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1137/1.9781611971088openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1287/mnsc.12.1.122openalex-snapshot
An Infinite Linear Program with a Duality Gap
inferredcites →https://doi.org/10.1287/mnsc.9.2.209openalex-snapshot
Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_26openalex-snapshot
Stability for a Class of Nonlinear Optimization Problems and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_865-1openalex-snapshot
Duality in Convex Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-8625-3_27openalex-snapshot
Scalar Minimax Properties in Vectorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_2openalex-snapshot
Semi-Infinite Programming Duality: How Special is It?
inferred← citeshttps://doi.org/10.1007/bf00934081openalex-snapshot
Perfect duality for convexlike programs
inferred← citeshttps://doi.org/10.1007/bf00935755openalex-snapshot
The limiting Lagrangian as a consequence of Helly's theorem
inferred← citeshttps://doi.org/10.1007/bf00938595openalex-snapshot
Limiting Lagrangians: A primal approach
inferred← citeshttps://doi.org/10.1007/bf00939737openalex-snapshot
Zero duality gaps in infinite-dimensional programming
inferred← citeshttps://doi.org/10.1007/bf01585706openalex-snapshot
A note on d-stability of convex programs and limiting Lagrangians
inferred← citeshttps://doi.org/10.1007/bf01589340openalex-snapshot
Duality gaps in semi-infinite linear programming—an approximation problem
inferred← citeshttps://doi.org/10.1007/bf02591888openalex-snapshot
A note on limiting infisup theorems
inferred← citeshttps://doi.org/10.1007/bf02591965openalex-snapshot
A duality theorem for semi-infinite convex programs and their finite subprograms
inferred← citeshttps://doi.org/10.1007/bfb0120920openalex-snapshot
Lagrangean functions and affine minorants
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/s11590-022-01865-xopenalex-snapshot
Duality for convex infinite optimization on linear spaces
inferred← citeshttps://doi.org/10.1080/02331938708843278openalex-snapshot
Reduction and Discrete Approximation in Linear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1287/moor.11.1.30openalex-snapshot
On the Duality Gap in Nonconvex 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.