On the public citation graph

Strong unicity and alternation for linear optimization

https://doi.org/10.1007/bf00940642
0 signed · 29 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-1-4613-8295-9_12openalex-snapshot
Constructive Function Theory
inferredcites →https://doi.org/10.1007/978-3-0348-6253-0openalex-snapshot
Parametric Optimization and Approximation
inferredcites →https://doi.org/10.1007/978-3-0348-6253-0_15openalex-snapshot
Unicity in Semi-Infinite Optimization
inferredcites →https://doi.org/10.1007/978-3-322-93108-5openalex-snapshot
Numerische Methoden der Approximation und semi-infiniten Optimierung
inferredcites →https://doi.org/10.1007/978-3-662-01480-6_6openalex-snapshot
Lineare Ungleichungen
inferredcites →https://doi.org/10.1007/bf00935322openalex-snapshot
A refinement of an optimality criterion and its application to parametric programming
inferredcites →https://doi.org/10.1007/bf01442122openalex-snapshot
Farkas-Minkowski systems in semi-infinite programming
inferredcites →https://doi.org/10.1007/bf01457106openalex-snapshot
Die Minkowskische Geometrie und die Annäherung an stetige Funktionen
inferredcites →https://doi.org/10.1016/0016-0032(66)90307-3openalex-snapshot
Approximation of functions
inferredcites →https://doi.org/10.1016/0021-9045(73)90091-9openalex-snapshot
Characterizations of strong unicity in approximation theory
inferredcites →https://doi.org/10.1080/01630568208816130openalex-snapshot
A local version of haar's theorem in approximation theory
inferredcites →https://doi.org/10.1080/01630568508816209openalex-snapshot
Global unicity in semi-infinite optimization
inferredcites →https://doi.org/10.1112/blms/14.2.175openalex-snapshot
SPLINE FUNCTIONS: Basic Theory
inferredcites →https://doi.org/10.1137/0109056openalex-snapshot
A Unified Approach to Certain Problems of Approximation and Minimization
inferredcites →https://doi.org/10.1215/s0012-7094-63-03071-0openalex-snapshot
Some theorems on Čebyšev approximation
inferredcites →https://doi.org/10.1287/mnsc.12.1.122openalex-snapshot
An Infinite Linear Program with a Duality Gap
inferredcites →https://doi.org/10.1287/mnsc.9.2.209openalex-snapshot
Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
inferredcites →https://doi.org/10.2307/2007301openalex-snapshot
Spline Functions: Basic Theory.
inferredcites →https://doi.org/10.2307/2373381openalex-snapshot
Uniqueness and Differential Characterization of Approximations from Manifolds of Functions

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-2868-2_1openalex-snapshot
A Comprehensive Survey of Linear Semi-Infinite Optimization Theory
inferred← citeshttps://doi.org/10.1007/bf01540158openalex-snapshot
On Haar's dual problem
inferred← citeshttps://doi.org/10.1007/bf02193460openalex-snapshot
Unicity in linear optimization
inferred← citeshttps://doi.org/10.1007/s00186-015-0513-1openalex-snapshot
First order solutions in conic programming
inferred← citeshttps://doi.org/10.1007/s002459900080openalex-snapshot
Unicity Results for General Linear Semi-Infinite Optimization Problems Using a New Concept of Active Constraints
inferred← citeshttps://doi.org/10.1007/s10957-023-02256-7openalex-snapshot
Generalized Polarity and Weakest Constraint Qualifications in Multiobjective Optimization
inferred← citeshttps://doi.org/10.1016/0022-247x(92)90151-3openalex-snapshot
On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
inferred← citeshttps://doi.org/10.1080/01630569008816374openalex-snapshot
Strong unicity in normed linear spaces
inferred← citeshttps://doi.org/10.1080/01630569508816638openalex-snapshot
Optimality theory for semi-infinite linear programming ∗
inferred← citeshttps://doi.org/10.1080/02331934.2024.2322155openalex-snapshot
On the weakest constraint qualification for sharp local minimizers
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.