On the public citation graph
A duality theorem for semi-infinite convex programs and their finite subprograms
0 signed · 36 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/bf00934327openalex-snapshot
A pathological semi-infinite program verifying Karlovitz's conjecture
inferredcites →https://doi.org/10.1007/bf00935755openalex-snapshot
The limiting Lagrangian as a consequence of Helly's theorem
inferredcites →https://doi.org/10.1007/bf00938595openalex-snapshot
Limiting Lagrangians: A primal approach
inferredcites →https://doi.org/10.1007/bf01584251openalex-snapshot
Direct theorems in semi-infinite convex programming
inferredcites →https://doi.org/10.1007/bf01588327openalex-snapshot
A note on perfect duality and limiting lagrangeans
inferredcites →https://doi.org/10.1007/bf01589340openalex-snapshot
Duality gaps in semi-infinite linear programming—an approximation problem
inferredcites →https://doi.org/10.1007/bf02591942openalex-snapshot
Uniform duality in semi-infinite convex optimization
inferredcites →https://doi.org/10.1016/0196-8858(81)90036-1openalex-snapshot
Clark's theorem for semi-infinite convex programs
inferredcites →https://doi.org/10.1137/1.9781611970524openalex-snapshot
Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611970524.ch1openalex-snapshot
1. Conjugate Duality and Optimization
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
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/bf00938312openalex-snapshot
Optimal value function in semi-infinite programming
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/bf01585730openalex-snapshot
A one-phase algorithm for semi-infinite linear 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.1007/s12190-025-02469-1openalex-snapshot
Lagrange duality and saddle point criteria for semi-infinite variational programming problem with Caputo-Fabrizio fractional derivative
inferred← citeshttps://doi.org/10.1007/s40314-023-02569-3openalex-snapshot
Optimality and duality analysis for multiobjective interval-valued semi-infinite optimization problem having vanishing constraints
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.1016/0377-2217(92)90353-bopenalex-snapshot
A purification algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107324openalex-snapshot
Approximate mixed type duality for semi-infinite programs having equilibrium constraints
inferred← citeshttps://doi.org/10.1023/b:jota.0000037607.48762.45openalex-snapshot
On Constraint Qualifications in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1051/ro/2021064openalex-snapshot
On duality theory for multiobjective semi-infinite fractional optimization model using higher order convexity
inferred← citeshttps://doi.org/10.1080/02331934.2022.2031192openalex-snapshot
Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality
inferred← citeshttps://doi.org/10.1080/02331934.2023.2289026openalex-snapshot
Approximate optimality conditions and duality results for non-smooth semi-infinite programming problems
inferred← citeshttps://doi.org/10.1109/gsis.2017.8077724openalex-snapshot
Sufficient and necessary conditions of optimal solutions of semi-infinite convex programing
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.12677/aam.2026.159379openalex-snapshot
Lagrange Duality of Infinite Convex Optimization
inferred← citeshttps://doi.org/10.23952/jano.4.2022.1.02openalex-snapshot
Relaxed Lagrangian duality in convex infinite optimization: Reverse strong duality and optimality
inferred← citeshttps://doi.org/10.48550/arxiv.2106.09299openalex-snapshot
Relaxed Lagrangian duality in convex infinite optimization: reverse strong duality and optimality
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.