On the public citation graph

Optimal value function in semi-infinite programming

https://doi.org/10.1007/bf00938312
0 signed · 41 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.1002/nav.3800200310openalex-snapshot
Numerical treatment of a class of semi‐infinite programming problems
inferredcites →https://doi.org/10.1007/978-1-4612-1142-6openalex-snapshot
Linear Optimization and Approximation: An Introduction to the Theoretical Analysis and Numerical Treatment of Semi-infinite Programs
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-642-46477-5_11openalex-snapshot
A Review of Numerical Methods for Semi-Infinite Optimization
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/bf01386389openalex-snapshot
Newton's method for convex programming and Tchebycheff approximation
inferredcites →https://doi.org/10.1007/bf01442122openalex-snapshot
Farkas-Minkowski systems in semi-infinite programming
inferredcites →https://doi.org/10.1007/bf01582235openalex-snapshot
An implementation of a discretization method for semi-infinite 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/bf02591965openalex-snapshot
A duality theorem for semi-infinite convex programs and their finite subprograms
inferredcites →https://doi.org/10.1073/pnas.48.5.783openalex-snapshot
DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
inferredcites →https://doi.org/10.1080/01630568108816099openalex-snapshot
Continuity properties in semi-infinite parametric linear optimization
inferredcites →https://doi.org/10.1080/02331938708843278openalex-snapshot
Reduction and Discrete Approximation in Linear Semi-Infinite Programming
inferredcites →https://doi.org/10.1287/mnsc.12.1.122openalex-snapshot
An Infinite Linear Program with a Duality Gap
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471667196.ess3211openalex-snapshot
Semi‐Infinite Programming
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02391openalex-snapshot
Semi‐Infinite Programming
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02391.pub2openalex-snapshot
Semi‐Infinite Programming
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_444openalex-snapshot
Semi-Infinite Programming: Discretization Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_586openalex-snapshot
Semi-infinite Programming: Discretization Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-89496-6_2openalex-snapshot
Post-Optimal Analysis of Linear Semi-Infinite Programs
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/978-1-4757-2868-2_7openalex-snapshot
Numerical Methods for Semi-Infinite Programming: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_586-1openalex-snapshot
Semi-infinite Programming: Discretization Methods
inferred← citeshttps://doi.org/10.1007/bf00940517openalex-snapshot
Conditions for the uniqueness of the optimal solution in linear semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01182979openalex-snapshot
Convergence of stationary sequences for variational inequalities with maximal monotone operators
inferred← citeshttps://doi.org/10.1007/bf01740508openalex-snapshot
Geometric fundamentals of the simplex method in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02614308openalex-snapshot
How to deal with the unbounded in optimization: Theory and algorithms
inferred← citeshttps://doi.org/10.1007/bf02875980openalex-snapshot
The stability of the maximum entropy method for nonsmooth semi-infinite programmings
inferred← citeshttps://doi.org/10.1007/s10013-020-00396-1openalex-snapshot
Marco A. López, a Pioneer of Continuous Optimization in Spain
inferred← citeshttps://doi.org/10.1007/s10288-017-0350-6openalex-snapshot
Recent contributions to linear semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/s10479-018-2987-8openalex-snapshot
Recent contributions to linear semi-infinite optimization: an update
inferred← citeshttps://doi.org/10.1007/s10898-009-9462-7openalex-snapshot
A new smoothing Newton-type algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.08.045openalex-snapshot
Semi-infinite programming
inferred← citeshttps://doi.org/10.1080/02331934.2023.2230998openalex-snapshot
Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
inferred← citeshttps://doi.org/10.1137/070700413openalex-snapshot
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
inferred← citeshttps://doi.org/10.1137/0803034openalex-snapshot
Convex Functions with Unbounded Level Sets and Applications to Duality Theory
inferred← citeshttps://doi.org/10.1137/s1052623402401944openalex-snapshot
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
inferred← citeshttps://doi.org/10.1287/moor.2016.0793openalex-snapshot
Genericity Results in Linear Conic Programming—A Tour d’Horizon
inferred← citeshttps://doi.org/10.68381/jca15054openalex-snapshot
A Complete Characterization of the Subdifferential Set of the Supremum of an Arbitrary Family of 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.