On the public citation graph
Direct theorems in semi-infinite convex programming
0 signed · 57 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.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/bf00935300openalex-snapshot
Affine minorants minimizing the sum of convex functions
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferredcites →https://doi.org/10.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
inferredcites →https://doi.org/10.1073/pnas.48.5.783openalex-snapshot
DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
inferredcites →https://doi.org/10.1112/blms/11.3.363aopenalex-snapshot
MODERN METHODS IN TOPOLOGICAL VECTOR SPACES
inferredcites →https://doi.org/10.1137/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferredcites →https://doi.org/10.1215/s0012-7094-65-03238-2openalex-snapshot
Helly’s theorem and minima of convex functions
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.1287/mnsc.9.2.209openalex-snapshot
Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
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-4684-7600-2_10openalex-snapshot
Supplementary Bibliography
inferred← citeshttps://doi.org/10.1007/978-1-4757-9859-3openalex-snapshot
Convex analysis and nonlinear optimization : theory and examples
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-46477-5_4openalex-snapshot
Duality in Semi-Infinite Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_7openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/bf01033644openalex-snapshot
On regularity and stability in semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/bf01585695openalex-snapshot
Duality in infinite dimensional linear programming
inferred← citeshttps://doi.org/10.1007/bf02055190openalex-snapshot
Suggested research topics in sensitivity and stability analysis for semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/bf02591906openalex-snapshot
Optimality conditions for nondifferentiable convex semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02591942openalex-snapshot
Uniform duality in semi-infinite convex optimization
inferred← citeshttps://doi.org/10.1007/bf02591965openalex-snapshot
A duality theorem for semi-infinite convex programs and their finite subprograms
inferred← citeshttps://doi.org/10.1007/s00186-006-0099-8openalex-snapshot
Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s10107-026-02334-4openalex-snapshot
Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces
inferred← citeshttps://doi.org/10.1007/s10479-022-04810-4openalex-snapshot
Near-optimal solutions of convex semi-infinite programs via targeted sampling
inferred← citeshttps://doi.org/10.1007/s10589-020-00168-0openalex-snapshot
On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9400-8openalex-snapshot
Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
inferred← citeshttps://doi.org/10.1007/s10957-016-0914-1openalex-snapshot
Optimality Conditions for Semi-Infinite and Generalized Semi-Infinite Programs Via Lower Order Exact Penalty Functions
inferred← citeshttps://doi.org/10.1007/s11228-015-0320-0openalex-snapshot
Convex SIP Problems with Finitely Representable Compact Index Sets: Immobile Indices and the Properties of the Auxiliary NLP Problem
inferred← citeshttps://doi.org/10.1007/s11750-026-00713-wopenalex-snapshot
A brief tutorial on semi-infinite optimization: the model, applications and basic mathematical constructions
inferred← citeshttps://doi.org/10.1016/0022-247x(84)90172-0openalex-snapshot
Inequality systems and minimax theorems
inferred← citeshttps://doi.org/10.1016/j.sysconle.2023.105648openalex-snapshot
Attaining the Chebyshev bound for optimal learning: A numerical algorithm
inferred← citeshttps://doi.org/10.1023/a:1008282830093openalex-snapshot
Semidefinite Programming Relaxation for Nonconvex Quadratic Programs
inferred← citeshttps://doi.org/10.1080/00207728908910174openalex-snapshot
Evolutionary approach to functional diagnostics of dynamic systems: Part 1
inferred← citeshttps://doi.org/10.1080/00207728908910175openalex-snapshot
Evolutionary approach to the functional diagnostics of dynamic systems: Part 2
inferred← citeshttps://doi.org/10.1080/02331930412331286595openalex-snapshot
Duality for inexact semi-infinite linear programming
inferred← citeshttps://doi.org/10.1080/02331930902730070openalex-snapshot
Semi-infinite programming, duality, discretization and optimality conditions†
inferred← citeshttps://doi.org/10.1080/02331938708843228openalex-snapshot
Nonconvex theorems of the alternative and minimization
inferred← citeshttps://doi.org/10.1080/02331938708843278openalex-snapshot
Reduction and Discrete Approximation in Linear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1080/10556780500159128openalex-snapshot
Cutting plane algorithms for robust conic convex optimization problems
inferred← citeshttps://doi.org/10.1090/fic/037/08openalex-snapshot
Semi-infinite linear programming approaches to semidefinite programming problems
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383236openalex-snapshot
Towards Continuous-Time MPC: A Novel Trajectory Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/lcsys.2024.3439208openalex-snapshot
Exact Solutions to Minmax Optimal Control Problems for Constrained Noisy Linear Systems
inferred← citeshttps://doi.org/10.1137/080717973openalex-snapshot
Duality of Ellipsoidal Approximations via Semi-Infinite 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.1287/moor.2023.0361openalex-snapshot
A Moment-Sum-of-Squares Hierarchy for Robust Polynomial Matrix Inequality Optimization with Sum-of-Squares Convexity
inferred← citeshttps://doi.org/10.1287/moor.23.1.239openalex-snapshot
Shadow Prices in Infinite-Dimensional Linear Programming
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.