On the public citation graph
A one-phase algorithm for semi-infinite linear programming
0 signed · 34 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.1002/nav.3800200310openalex-snapshot
Numerical treatment of a class of semi‐infinite programming problems
inferredcites →https://doi.org/10.1007/978-3-642-46564-2_8openalex-snapshot
Lagrangian Methods for Semi-Infinite Programming Problems
inferredcites →https://doi.org/10.1007/978-3-642-46564-2_9openalex-snapshot
A New Primal Algorithm for Semi-Infinite Linear Programming
inferredcites →https://doi.org/10.1007/bf01582053openalex-snapshot
A projected lagrangian algorithm for 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/bf02591681openalex-snapshot
An exact penalty function for semi-infinite programming
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.1007/bfb0003887openalex-snapshot
A comparison of some numerical methods for semi-infinite programming
inferredcites →https://doi.org/10.1137/0902021openalex-snapshot
A Nonlinear Programming Problem in Statistics (Educational Testing)
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
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.6028/jres.049.027openalex-snapshot
On approximate solutions of systems of linear inequalities
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-4612-1306-2_15openalex-snapshot
Methods for Global Prior Robustness under Generalized Moment Conditions
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-1-4757-2868-2_9openalex-snapshot
Reliability Testing and Semi-Infinite Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_6openalex-snapshot
Nonconvex Optimization and Its Structural Frontiers
inferred← citeshttps://doi.org/10.1007/bf00138692openalex-snapshot
A globally convergent method for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1007/bf02238929openalex-snapshot
A semi-infinite programming method for approximating load duration curves by polynomials
inferred← citeshttps://doi.org/10.1007/s10107-003-0492-5openalex-snapshot
An accelerated central cutting plane algorithm for linear semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s10589-014-9654-zopenalex-snapshot
Solving semi-infinite programs by smoothing projected gradient method
inferred← citeshttps://doi.org/10.1007/s10589-015-9810-0openalex-snapshot
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s11590-021-01735-yopenalex-snapshot
A dual scheme for solving linear countable semi-infinite fractional programming problems
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90474-6openalex-snapshot
On approximate solutions of infinite systems of linear inequalities
inferred← citeshttps://doi.org/10.1016/0377-0427(92)00122-popenalex-snapshot
Some outer approximation methods for semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00544-6openalex-snapshot
Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00042-9openalex-snapshot
On the numerical treatment of linearly constrained semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1109/cdc.1995.478662openalex-snapshot
A Numerical Algorithm for Robust Stabilization of A Linear Parametric Uncertain System
inferred← citeshttps://doi.org/10.1109/tpami.2023.3348460openalex-snapshot
Semi-Infinitely Constrained Markov Decision Processes and Provably Efficient Reinforcement Learning
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1142/s0217595921400157openalex-snapshot
On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
inferred← citeshttps://doi.org/10.1214/lnms/1215453058openalex-snapshot
Numerical robust Bayesian analysis under generalized moment conditions
inferred← citeshttps://doi.org/10.22199/s07160917.1997.0002.00002openalex-snapshot
Un algoritmo cuasi-newton con aproximaciones consistentes para programacion semi-infinita
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.