On the public citation graph
Semi-Infinite Programming
0 signed · 105 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02391openalex-snapshot
Semi‐Infinite Programming
inferred← citeshttps://doi.org/10.1002/aic.690290312openalex-snapshot
Optimal process design under uncertainty
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_443openalex-snapshot
Semi-infinite programming and control problems; Semi-infinite programming: Discretization methods; Semi-infinite programming: Methods for linear problems; Semi-infinite programming: Numerical methods; Semi-infinite programming: Second order optimality conditions; Semi-infinite programming,…
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-1-4419-9640-4_9openalex-snapshot
On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity
inferred← citeshttps://doi.org/10.1007/978-1-4612-5545-1_25openalex-snapshot
An Interactive Program for Adaptively Analyzing Data
inferred← citeshttps://doi.org/10.1007/978-1-4615-3600-0_29openalex-snapshot
A Recursive, Volume-Reducing Algorithm for Semi-Infinite Linear Programming
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-1-4899-3442-0_23openalex-snapshot
Numerical methods for Chebyshev approximation of complex-valued functions
inferred← citeshttps://doi.org/10.1007/978-1-4939-0808-0_14openalex-snapshot
Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions
inferred← citeshttps://doi.org/10.1007/978-3-0348-7186-0_18openalex-snapshot
A Globally Convergent Method for (Constrained) Nonlinear Continuous Ll Approximation Problems
inferred← citeshttps://doi.org/10.1007/978-3-0348-8497-6_16openalex-snapshot
A New Class of a High Order Interior Point Method for the Solution of Convex Semiinfinite Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_10openalex-snapshot
A Three-Phase Algorithm for Semi-Infinite Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_13openalex-snapshot
Numerical Experiments with Globally Convergent Methods for Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_15openalex-snapshot
Semi-Infinite and Fuzzy Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_16openalex-snapshot
Semi-Infinite Optimization in Engineering Design
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_5openalex-snapshot
On the Role of Duality in the Theory of Moments
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_8openalex-snapshot
Lagrangian Methods for Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-48417-9_11openalex-snapshot
Extremal Spheres and Semi-Infinite Duality Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_11openalex-snapshot
Stability of Stationary Solutions in Semi-Infinite Optimization via the Reduction Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_7openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_4openalex-snapshot
Optimization under functional constraints (semi—infinite programming) and applications
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_7openalex-snapshot
Nonlinear Optimization Problems under Data Perturbations
inferred← citeshttps://doi.org/10.1007/978-94-011-0135-6_15openalex-snapshot
Optimization in Model Predictive Control
inferred← citeshttps://doi.org/10.1007/bf00138692openalex-snapshot
A globally convergent method for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1007/bf01183272openalex-snapshot
Two-dimensional model-based power spectrum estimation for nonextendible correlation bisequences
inferred← citeshttps://doi.org/10.1007/bf01389643openalex-snapshot
On constrained multivariate splines and their approximations
inferred← citeshttps://doi.org/10.1007/bf01582053openalex-snapshot
A projected lagrangian algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01582235openalex-snapshot
An implementation of a discretization method for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01582293openalex-snapshot
An interior point algorithm for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1007/bf01587092openalex-snapshot
An extension of the simplex algorithm for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1007/bf01588788openalex-snapshot
Second order necessary optimality conditions for minimizing a sup-type function
inferred← citeshttps://doi.org/10.1007/bf01740508openalex-snapshot
Geometric fundamentals of the simplex method in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01941472openalex-snapshot
Globally convergent methods for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02888700openalex-snapshot
Representacion finita de sistemas de infinitas inecuaciones
inferred← citeshttps://doi.org/10.1007/s00186-016-0546-0openalex-snapshot
Computing tight bounds via piecewise linear functions through the example of circle cutting problems
inferred← citeshttps://doi.org/10.1007/s10255-007-0365-4openalex-snapshot
Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-invex Functions
inferred← citeshttps://doi.org/10.1007/s10255-013-0204-8openalex-snapshot
Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized (α, η, ρ)-V-Invex functions
inferred← citeshttps://doi.org/10.1007/s10700-004-5569-yopenalex-snapshot
Bilevel Decision with Generalized Semi-infinite Optimization for Fuzzy Mappings as Lower Level Problems
inferred← citeshttps://doi.org/10.1007/s10898-013-0125-3openalex-snapshot
Cutting ellipses from area-minimizing rectangles
inferred← citeshttps://doi.org/10.1007/s10957-006-9049-0openalex-snapshot
Global Convergence of a Robust Smoothing SQP Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/s10957-010-9753-7openalex-snapshot
Semi-Infinite Optimization under Convex Function Perturbations: Lipschitz Stability
inferred← citeshttps://doi.org/10.1007/s10957-014-0687-3openalex-snapshot
Continuous Piecewise Linear Delta-Approximations for Univariate Functions: Computing Minimal Breakpoint Systems
inferred← citeshttps://doi.org/10.1016/0005-1098(82)90104-2openalex-snapshot
Computer-aided design via optimization
inferred← citeshttps://doi.org/10.1016/0005-1098(89)90009-5openalex-snapshot
Scheduling turbofan engine control set points by semi-infinite optimization
inferred← citeshttps://doi.org/10.1016/0021-9045(81)90061-7openalex-snapshot
On the local continuity of the Chebyshev operator
inferred← citeshttps://doi.org/10.1016/0021-9045(90)90047-topenalex-snapshot
A special one-sided approximation problem
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90024-9openalex-snapshot
A theory of linear inequality systems
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/0165-0114(89)90019-5openalex-snapshot
Fuzzy optimization: An appraisal
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90006-xopenalex-snapshot
New descent rules for solving the linear semi-infinite programming problem
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/0377-2217(88)90010-0openalex-snapshot
A comparative study of several semi-infinite nonlinear programming algorithms
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90353-bopenalex-snapshot
A purification algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1016/b978-0-08-035738-6.50012-4openalex-snapshot
ASPECTS OF OPTIMIZATION-BASED CADCS
inferred← citeshttps://doi.org/10.1016/j.apm.2008.05.008openalex-snapshot
Air pollution control with semi-infinite programming
inferred← citeshttps://doi.org/10.1016/j.cam.2007.02.012openalex-snapshot
Generalized semi-infinite programming: A tutorial
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.06.002openalex-snapshot
An approach for solving fuzzy implicit variational inequalities with linear membership functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.09.012openalex-snapshot
A relaxed cutting plane algorithm for solving the Vasicek-type forward interest rate model
inferred← citeshttps://doi.org/10.1016/j.fss.2003.09.010openalex-snapshot
Solving a class of fuzzy linear programs by using semi-infinite programming techniques
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2013.08.009openalex-snapshot
Fixed frequency sliding mode-based robust inversion with a full-bridge current DC-link buck-boost
inferred← citeshttps://doi.org/10.1016/j.jprocont.2012.03.008openalex-snapshot
Robust optimization of nonlinear dynamic systems with application to a jacketed tubular reactor
inferred← citeshttps://doi.org/10.1016/j.neucom.2012.08.009openalex-snapshot
Estimating α-frontier technical efficiency with shape-restricted kernel quantile regression
inferred← citeshttps://doi.org/10.1016/s0167-9473(03)00152-xopenalex-snapshot
A parallel algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00103-2openalex-snapshot
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
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/s0378-3758(02)00259-8openalex-snapshot
Testing of monotonicity in parametric regression models
inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00203-5openalex-snapshot
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)54929-0openalex-snapshot
Aspects of Optimization-based CADCS
inferred← citeshttps://doi.org/10.1023/a:1019208524259openalex-snapshot
A Dual Parametrization Method for Convex Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1023/a:1020234019886openalex-snapshot
An Adaptive Dual Parametrization Algorithm for Quadratic Semi-infinite Programming Problems
inferred← citeshttps://doi.org/10.1023/a:1021763419562openalex-snapshot
Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1023/b:fodm.0000003951.40291.b8openalex-snapshot
Maximum Feasibility Problem for Continuous Linear Inequalities with Applications to Fuzzy Linear Programming
inferred← citeshttps://doi.org/10.1023/b:reom.0000032109.55408.1aopenalex-snapshot
On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory
inferred← citeshttps://doi.org/10.1029/92jb00739openalex-snapshot
Inference in infinite‐dimensional inverse problems: Discretization and duality
inferred← citeshttps://doi.org/10.1080/00207179408923098openalex-snapshot
An optimization approach to robust nonlinear control design
inferred← citeshttps://doi.org/10.1080/00207728708967135openalex-snapshot
ImplementableL∞penalty-function method for semi-infinite optimization
inferred← citeshttps://doi.org/10.1080/02331930701779013openalex-snapshot
Complexity aspects of a semi-infinite optimization problem†
inferred← citeshttps://doi.org/10.1080/02331938708843278openalex-snapshot
Reduction and Discrete Approximation in Linear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1080/10556780310001634091openalex-snapshot
A quasi-Newton interior point method for semi-infinite programming
inferred← citeshttps://doi.org/10.1090/fic/037/08openalex-snapshot
Semi-infinite linear programming approaches to semidefinite programming problems
inferred← citeshttps://doi.org/10.1090/s0025-5718-09-02206-6openalex-snapshot
Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1109/43.848089openalex-snapshot
Noise considerations in circuit optimization
inferred← citeshttps://doi.org/10.1109/43.856971openalex-snapshot
Efficient handling of operating range and manufacturing line variations in analog cell synthesis
inferred← citeshttps://doi.org/10.1109/78.622941openalex-snapshot
The role of linear semi-infinite programming in signal-adapted QMF bank design
inferred← citeshttps://doi.org/10.1109/9.29441openalex-snapshot
A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
inferred← citeshttps://doi.org/10.1109/cdc.1983.269871openalex-snapshot
Nonuniform, dynamically adapted discretization for functional constraints in engineering design problems
inferred← citeshttps://doi.org/10.1109/iscas.1994.408774openalex-snapshot
Application of the piecewise ellipsoidal approximation technique to design centering
inferred← citeshttps://doi.org/10.1137/0722001openalex-snapshot
Discrete Chebyshev Approximation with Linear Constraints
inferred← citeshttps://doi.org/10.1137/1029002openalex-snapshot
On the Mathematical Foundations of Nondifferentiable Optimization in Engineering Design
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1137/s0363012902415487openalex-snapshot
An Outer Approximation Method for the Variational Inequality Problem
inferred← citeshttps://doi.org/10.1137/s0363012994263202openalex-snapshot
A General Stochastic Outer Approximations Method
inferred← citeshttps://doi.org/10.1142/s0218488507004662openalex-snapshot
A MONTE CARLO SIMULATION BASED APPROACH FOR STOCHASTIC SEMI-INFINITE MATHEMATICAL PROGRAMMING PROBLEMS
inferred← citeshttps://doi.org/10.1145/288548.288617openalex-snapshot
Noise considerations in circuit optimization
inferred← citeshttps://doi.org/10.1186/s13660-015-0775-4openalex-snapshot
Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities
inferred← citeshttps://doi.org/10.3934/jimo.2010.6.15openalex-snapshot
A numerical approach to infinite-dimensional linear programming in $L_1$ spaces
inferred← citeshttps://doi.org/10.4236/ajor.2021.116018openalex-snapshot
A Kaleodoscopic View of Fuzzy Stochastic Optimization*
inferred← citeshttps://doi.org/10.4314/ajst.v2i1.44628openalex-snapshot
A cutting- plane approach for semi- infinite mathematical 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.