On the public citation graph

A limiting Lagrangian for infinitely constrained convex optimization inR n

https://doi.org/10.1007/bf00935754
0 signed · 27 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00935300openalex-snapshot
Affine minorants minimizing the sum of convex functions
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/bf01609002openalex-snapshot
Convex optimization and lagrange multipliers
inferredcites →https://doi.org/10.1016/0022-247x(74)90222-4openalex-snapshot
A note on infinite systems of linear inequalities in Rn
inferredcites →https://doi.org/10.1287/mnsc.12.1.113openalex-snapshot
On Representations of Semi-Infinite Programs which Have No Duality Gaps
inferredcites →https://doi.org/10.1287/mnsc.12.1.122openalex-snapshot
An Infinite Linear Program with a Duality Gap
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex 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/978-1-4757-3216-0_7openalex-snapshot
Central Region Method
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_1openalex-snapshot
Ascent Ray Theorems and Some Applications
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/978-3-642-68874-4_7openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/bf00934766openalex-snapshot
A limiting infisup theorem
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/bf01588327openalex-snapshot
A note on perfect duality and limiting lagrangeans
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/bf02591942openalex-snapshot
Uniform duality in semi-infinite convex optimization
inferred← citeshttps://doi.org/10.1007/bfb0120920openalex-snapshot
Lagrangean functions and affine minorants
inferred← citeshttps://doi.org/10.1016/0021-9045(85)90068-1openalex-snapshot
In a semi-infinite program only a countable subset of the constraints is essential
inferred← citeshttps://doi.org/10.1023/a:1022606002804openalex-snapshot
Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
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
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.