On the public citation graph

Constructing a perfect duality in infinite programming

https://doi.org/10.1007/bf01448186
0 signed · 43 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/978-3-322-94887-8openalex-snapshot
Optimierung und Approximation
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/bf00536646openalex-snapshot
Optimierungsaufgaben in topologischen Vektorr�umen I: Dualit�tstheorie
inferredcites →https://doi.org/10.1007/bf01580450openalex-snapshot
The theorem of the alternative, the key-theorem, and the vector-maximum problem
inferredcites →https://doi.org/10.1007/bf01584656openalex-snapshot
Convex analysis treated by linear programming
inferredcites →https://doi.org/10.1007/bf02771577openalex-snapshot
On semi-infinite systems of linear inequalities
inferredcites →https://doi.org/10.1016/0022-247x(68)90206-0openalex-snapshot
A duality theory for abstract mathematical programs with applications to optimal control theory
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.1073/pnas.48.5.783openalex-snapshot
DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES

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/0-306-48332-7_448openalex-snapshot
Semi-Infinite Programming, Semidefinite Programming and Perfect Duality
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_590openalex-snapshot
Semi-infinite Programming, Semidefinite Programming and Perfect Duality
inferred← citeshttps://doi.org/10.1007/978-1-4899-8044-1_1openalex-snapshot
Preliminaries on Linear Semi-infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4899-8044-1_2openalex-snapshot
Modeling Uncertain Linear Semi-infinite Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4899-8044-1_3openalex-snapshot
Robust Linear Semi-infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4899-8044-1_4openalex-snapshot
Sensitivity Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4899-8044-1_5openalex-snapshot
Qualitative Stability Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4899-8044-1_6openalex-snapshot
Quantitative Stability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_590-1openalex-snapshot
Semi-Infinite Programming, Semidefinite Programming, and Perfect Duality
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/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/bf00939275openalex-snapshot
Convex semi-infinite games
inferred← citeshttps://doi.org/10.1007/bf00939737openalex-snapshot
Zero duality gaps in infinite-dimensional programming
inferred← citeshttps://doi.org/10.1007/bf01442122openalex-snapshot
Farkas-Minkowski systems in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01540158openalex-snapshot
On Haar's dual problem
inferred← citeshttps://doi.org/10.1007/bf01588327openalex-snapshot
A note on perfect duality and limiting lagrangeans
inferred← citeshttps://doi.org/10.1007/bf02888700openalex-snapshot
Representacion finita de sistemas de infinitas inecuaciones
inferred← citeshttps://doi.org/10.1007/bf02888777openalex-snapshot
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
inferred← citeshttps://doi.org/10.1016/0196-8858(84)90018-6openalex-snapshot
Cluster sets of vector series
inferred← citeshttps://doi.org/10.1016/0196-8858(85)90005-3openalex-snapshot
Intrinsic linear programming
inferred← citeshttps://doi.org/10.1080/00036811.2018.1514018openalex-snapshot
Weak-subdifferentials for vector functions and applications to multiobjective semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1080/02331930701618690openalex-snapshot
Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
inferred← citeshttps://doi.org/10.1080/02331934.2025.2579724openalex-snapshot
Lagrange dualities for DC infinite 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.11650/tjm.18.2014.3888openalex-snapshot
LOCAL AND GLOBAL OPTIMALITY CONDITIONS FOR DC INFINITE OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.11650/tjm/180603openalex-snapshot
An Approach to $\epsilon$-duality Theorems for Nonconvex Semi-infinite Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1186/1687-1812-2013-269openalex-snapshot
Total Lagrange duality for DC infinite optimization problems
inferred← citeshttps://doi.org/10.1186/s13660-015-0561-3openalex-snapshot
Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
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.