On the public citation graph
Convex analysis treated by linear programming
0 signed · 42 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.1016/0022-247x(74)90270-4openalex-snapshot
Classifying convex extremum problems over linear topologies having separation properties
inferredcites →https://doi.org/10.1016/s0021-9800(67)80110-8openalex-snapshot
An orthogonality theorem of dines related to moment problems and linear programming
inferredcites →https://doi.org/10.1137/0119049openalex-snapshot
Symmetric Duality for Generalized Unconstrained Geometric Programming
inferredcites →https://doi.org/10.1137/1013001openalex-snapshot
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
inferredcites →https://doi.org/10.1137/1013065openalex-snapshot
Linear Programming in Reflexive Spaces
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.1006/jmaa.1998.6189openalex-snapshot
On Duality in Semi-Infinite Programming and Existence Theorems for Linear Inequalities
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-642-46477-5openalex-snapshot
Semi-Infinite Programming and 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/bf00934081openalex-snapshot
Perfect duality for convexlike programs
inferred← citeshttps://doi.org/10.1007/bf00934327openalex-snapshot
A pathological semi-infinite program verifying Karlovitz's conjecture
inferred← citeshttps://doi.org/10.1007/bf00935754openalex-snapshot
A limiting Lagrangian for infinitely constrained convex optimization inR n
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/bf01061299openalex-snapshot
Linear inequalities in mathematical programming and pattern recognition
inferred← citeshttps://doi.org/10.1007/bf01448186openalex-snapshot
Constructing a perfect duality in infinite programming
inferred← citeshttps://doi.org/10.1007/bf01588327openalex-snapshot
A note on perfect duality and limiting lagrangeans
inferred← citeshttps://doi.org/10.1007/bf01609002openalex-snapshot
Convex optimization and lagrange multipliers
inferred← citeshttps://doi.org/10.1007/bfb0120920openalex-snapshot
Lagrangean functions and affine minorants
inferred← citeshttps://doi.org/10.1007/s00186-021-00761-xopenalex-snapshot
Strong duality for standard convex programs
inferred← citeshttps://doi.org/10.1007/s10957-017-1097-0openalex-snapshot
Perfect Duality in Solving Geometric Programming Problems Under Uncertainty
inferred← citeshttps://doi.org/10.1007/s11590-022-01865-xopenalex-snapshot
Duality for convex infinite optimization on linear spaces
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/0022-247x(74)90270-4openalex-snapshot
Classifying convex extremum problems over linear topologies having separation properties
inferred← citeshttps://doi.org/10.1016/b978-0-12-370450-4.50020-0openalex-snapshot
A Demographic Turnpike for Long-Range Manpower Planning in Developing Economies
inferred← citeshttps://doi.org/10.1080/00036817608839138openalex-snapshot
On a classification scheme for geometric programming and complementarity theorems† †
inferred← citeshttps://doi.org/10.1080/02331934.2015.1080700openalex-snapshot
A simplified conjugation scheme for lower semi-continuous functions
inferred← citeshttps://doi.org/10.1080/02331937908842560openalex-snapshot
Duality in convex programming: a linearization approach1
inferred← citeshttps://doi.org/10.1137/0130049openalex-snapshot
Primal Geometric Programs Treated by Linear Programming
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.1515/dema-2025-0176openalex-snapshot
On inequalities involving n -polynomial exponential-type convex functions
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.