On the public citation graph
Uniform duality in semi-infinite convex optimization
0 signed · 31 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-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-642-46477-5_4openalex-snapshot
Duality in Semi-Infinite Linear Programming
inferredcites →https://doi.org/10.1007/bf00935754openalex-snapshot
A limiting Lagrangian for infinitely constrained convex optimization inR n
inferredcites →https://doi.org/10.1007/bf01584251openalex-snapshot
Direct theorems in semi-infinite convex programming
inferredcites →https://doi.org/10.1007/bf01589340openalex-snapshot
Duality gaps in semi-infinite linear programming—an approximation problem
inferredcites →https://doi.org/10.1007/bf01609002openalex-snapshot
Convex optimization and lagrange multipliers
inferredcites →https://doi.org/10.1007/bf02591942openalex-snapshot
Uniform duality in semi-infinite convex optimization
inferredcites →https://doi.org/10.1007/bfb0120920openalex-snapshot
Lagrangean functions and affine minorants
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
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-3-642-46477-5_4openalex-snapshot
Duality in Semi-Infinite Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_2openalex-snapshot
Conditions for the Closedness of the Characteristic Cone Associated with an Infinite Linear System
inferred← citeshttps://doi.org/10.1007/bf00939737openalex-snapshot
Zero duality gaps in infinite-dimensional programming
inferred← citeshttps://doi.org/10.1007/bf02591906openalex-snapshot
Optimality conditions for nondifferentiable convex semi-infinite programming
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/s10107-013-0668-6openalex-snapshot
Robust linear semi-infinite programming duality under uncertainty
inferred← citeshttps://doi.org/10.1007/s10898-009-9400-8openalex-snapshot
Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
inferred← citeshttps://doi.org/10.1007/s10957-024-02515-1openalex-snapshot
On the Uniform Duality in Copositive Optimization
inferred← citeshttps://doi.org/10.1007/s11228-017-0462-3openalex-snapshot
Revisiting some Rules of Convex Analysis
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/j.na.2006.12.014openalex-snapshot
Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
inferred← citeshttps://doi.org/10.1016/j.orl.2019.01.005openalex-snapshot
Exact relaxations for parametric robust linear optimization problems
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.3934/jimo.2023098openalex-snapshot
Approximate solution in robust multi-objective optimization and its application in portfolio optimization
showing the first 15 of 16 · page through all 16
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.