Semi-Infinite Programming: Theory, Methods, and Applications
From MaRDI portal
Publication:3142767
DOI10.1137/1035089zbMath0784.90090OpenAlexW2075887074WikidataQ60306117 ScholiaQ60306117MaRDI QIDQ3142767
No author found.
Publication date: 21 March 1994
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1035089
duality theoryparametric analysisalgorithms for functional approximationfirst- and second-order optimality conditions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Algorithms for approximation of functions (65D15)
Related Items
Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ Existence of augmented Lagrange multipliers for semi-infinite programming problems ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Solving a class of fuzzy linear programs by using semi-infinite programming techniques ⋮ Robust mechanism design and production structure for assembly systems with asymmetric cost information ⋮ Deletion-by-infeasibility rule for DC-constrained global optimization ⋮ An entropic regularized method of centers for continuous minimax problem with semi infinite constraints ⋮ Frameworks and results in distributionally robust optimization ⋮ An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ Parametric linear semi-infinite programming ⋮ A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ A globally convergent method for semi-infinite linear programming ⋮ The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets ⋮ On saddle points in nonconvex semi-infinite programming ⋮ Inverse optimization in semi-infinite linear programs ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Implicit optimality criterion for convex SIP problem with box constrained index set ⋮ Optimality analysis of a class of semi-infinite programming problems ⋮ Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential ⋮ Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ An augmented Lagrangian algorithm for solving semiinfinite programming ⋮ Design of 2D linear phase DFT modulated filter banks using bi-iterative second-order cone program ⋮ A dual parametrization approach to Nyquist filter design ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ A perturbation method for solving linear semi-infinite programming problems ⋮ Linear programming with fuzzy coefficients in constraints ⋮ Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method ⋮ Robust trade-off portfolio selection ⋮ The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations ⋮ Relaxed cutting plane method for solving linear semi-infinite programming problems ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ Extension of the LP-Newton method to conic programming problems via semi-infinite representation ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ On the linear convergence rates of exchange and continuous methods for total variation minimization ⋮ Continuity and closedness of constraint and solution set mappings in unified parametric semi-infinite vector optimization ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ Extremal bootstrapping: go with the flow ⋮ Cutting ellipses from area-minimizing rectangles ⋮ How to solve a semi-infinite optimization problem ⋮ A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination ⋮ Discretization method for semi-definite programming ⋮ A new proof of the strong duality theorem for semidefinite programming ⋮ Bilevel decision with generalized semi-infinite optimization for fuzzy mappings as lower level problems ⋮ On a class of fuzzy parametric variational inequality controlled differential equation problems in finite dimension spaces ⋮ A smoothing Newton method for semi-infinite programming ⋮ Duality theorems and algorithms for linear programming in measure spaces ⋮ An approximation approach to non-strictly convex quadratic semi-infinite programming ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Global solution of semi-infinite programs ⋮ On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Global solution of semi-infinite programs with existence constraints ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ Derivative-free robust optimization by outer approximations ⋮ Backward-forward reachable set splitting for state-constrained differential games ⋮ A dynamic game approach to distributionally robust safety specifications for stochastic systems ⋮ Multi-kernel unmixing and super-resolution using the modified matrix pencil method ⋮ Exact relaxations for parametric robust linear optimization problems ⋮ A model of distributionally robust two-stage stochastic convex programming with linear recourse ⋮ On sparse beamformer design with reverberation ⋮ Ergodic approach to robust optimization and infinite programming problems ⋮ Multiple kernel dimensionality reduction via ratio-trace and marginal Fisher analysis ⋮ Generalized semi-infinite programming: Theory and methods ⋮ A geometric branch and bound method for robust maximization of convex functions ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ Numerical experiments in semi-infinite programming ⋮ Solving min-max problems and linear semi-infinite programs ⋮ Distributionally robust optimization. A review on theory and applications ⋮ Strong duality for general quadratic programs with quadratic equality constraints ⋮ Pareto solutions in multicriteria optimization under uncertainty ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints ⋮ On generalized semi-infinite optimization and bilevel optimization ⋮ A spline smoothing Newton method for semi-infinite minimax problems ⋮ An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions. ⋮ Near-optimal solutions of convex semi-infinite programs via targeted sampling ⋮ Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions ⋮ Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification ⋮ A projection approach to monotonic regression with Bernstein polynomials ⋮ Testing of monotonicity in parametric regression models ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming ⋮ A dual scheme for solving linear countable semi-infinite fractional programming problems ⋮ Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem ⋮ The maximax minimax quotient theorem ⋮ Problem-based optimal scenario generation and reduction in stochastic programming ⋮ An approximation of feasible sets in semi-infinite optimization. ⋮ Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ On the relationship between the discrete and continuous bounding moment problems and their numerical solutions ⋮ New descent rules for solving the linear semi-infinite programming problem ⋮ Interior-point algorithms for semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ Study of a special nonlinear problem arising in convex semi-infinite programming ⋮ The Lagrange approach to infinite linear programs ⋮ Ambiguity in risk preferences in robust stochastic optimization ⋮ Constraint aggregation principle in convex optimization ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ Process optimization under uncertainty when there is not enough process data at the operation stage ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ Semi-infinite programming ⋮ Optimization with a class of multivariate integral stochastic order constraints ⋮ Minimum-time control of a crane with simultaneous traverse and hoisting motions ⋮ A semi-infinite programming model for earliness/tardiness production planning with simulated annealing ⋮ Scenario approximation of robust and chance-constrained programs ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients ⋮ On the convergence of a smoothed penalty algorithm for semi-infinite programming ⋮ A robust optimization approach to experimental design for model discrimination of dynamical systems ⋮ A ladder method for linear semi-infinite programming ⋮ A new exact penalty method for semi-infinite programming problems ⋮ A global optimization approach to scalar \(H_2/H_\infty\) control ⋮ Fixed frequency sliding mode-based robust inversion with a full-bridge current DC-link buck-boost ⋮ First order solutions in conic programming ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ Local optimization of dynamic programs with guaranteed satisfaction of path constraints ⋮ A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming ⋮ Robot trajectory planning with semi-infinite programming. ⋮ Nonsmooth semi-infinite programming problem using limiting subdifferentials ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ Worst case risk measurement: back to the future? ⋮ Generalized semi-infinite programming: a tutorial ⋮ A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints ⋮ Kernel methods in machine learning ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ The semismooth approach for semi-infinite programming under the reduction ansatz ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ On the closure of the feasible set in generalized semi-infinite programming ⋮ Uniform LP duality for semidefinite and semi-infinite programming ⋮ Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ Optimality conditions for nonlinear infinite programming problems ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ First order optimality conditions for generalized semi-infinite programming problems ⋮ Quasipolyhedral sets in linear semiinfinite inequality systems ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ On the stability of solutions for semi-infinite vector optimization problems ⋮ Generalized semi-infinite programming: On generic local minimizers ⋮ A parallel algorithm for semi-infinite programming ⋮ Augmented lagrangians in semi-infinite programming ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ Duality for nonsmooth semi-infinite programming problems ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ Air pollution control with semi-infinite programming ⋮ Learning the coordinate gradients ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Solving continuous min-max problems by an iterative entropic regularization method. ⋮ On constraint qualifications in nonsmooth optimization. ⋮ Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities ⋮ On numerical optimization theory of infinite kernel learning ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Robust resource allocations in temporal networks ⋮ Design of oversampled double-prototype DFT modulated filter banks via bi-iterative second-order cone program ⋮ Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ A review of infinite matrices and their applications ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ An approach for solving fuzzy implicit variational inequalities with linear membership functions ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ A theory of learning with similarity functions ⋮ Solutions of fuzzy multiobjective programming problems based on the concept of scalarization ⋮ Worst-case estimation for econometric models with unobservable components ⋮ On optimization, dynamics and uncertainty: A tutorial for gene-environment networks ⋮ A filter trust region method for solving semi-infinite programming problems ⋮ On duality in semi-infinite programming and existence theorems for linear inequalities ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions ⋮ Generalized semi-infinite optimization: A first order optimality condition and examples ⋮ Support vector machine classification with indefinite kernels ⋮ On optimality conditions for generalized semi-infinite programming problems ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints ⋮ Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Error bounds of two smoothing approximations for semi-infinite minimax problems ⋮ First-order optimality conditions in generalized semi-infinite programming ⋮ Locally Farkas-Minkowski linear inequality systems ⋮ A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ On equivalent representations and properties of faces of the cone of copositive matrices ⋮ THE RANGE OF TRADED OPTION PRICES ⋮ Global convergence of a robust smoothing SQP method for semi-infinite programming ⋮ A relaxed cutting plane algorithm for solving fuzzy inequality systems ⋮ Towards rigorous robust optimal control via generalized high-order moment expansion ⋮ A cover partitioning method for bound constrained global optimization ⋮ Monotone Smoothing Splines using General Linear Systems ⋮ Convex Parametric Programming in Abstract Spaces ⋮ Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ Gradient methods and conic least-squares problems ⋮ On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity ⋮ Feasible Method for Semi-Infinite Programs ⋮ A homotopy interior point method for semi-infinite programming problems ⋮ Multiple Kernel Learning with Gaussianity Measures ⋮ Solution Bounds for Elliptic Partial Differential Equations via Feynman-Kac Representation ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ A relaxed cutting plane algorithm for solving the Vasicek-type forward interest rate model ⋮ On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ A fuzzy semi-infinite optimization problem ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Stability Analysis for Semi-Infinite Vector Optimization Problems under Functional Perturbations ⋮ How to solve a design centering problem ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ An adaptive numerical method for semi-infinite elliptic control problems based on error estimates ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Quadratic two-stage stochastic optimization with coherent measures of risk ⋮ Optimality theory for semi-infinite linear programming∗ ⋮ On Proper Efficiency in Multiobjective Semi-infinite Optimization ⋮ Optimization with Multivariate Stochastic Dominance Constraints ⋮ A class of two-stage distributionally robust games ⋮ Necessary optimality conditions for a nonsmooth semi-infinite programming problem ⋮ Stability in unified semi-infinite vector optimization ⋮ Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models ⋮ Nonlinear robust optimization via sequential convex bilevel programming ⋮ Copositive programming via semi-infinite optimization ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ Genericity Results in Linear Conic Programming—A Tour d’Horizon ⋮ On some generalized equations with metrically C-increasing mappings: solvability and error bounds with applications to optimization ⋮ Unnamed Item ⋮ Characterization of Matrix-Exponential Distributions ⋮ Generic Consistency for Approximate Stochastic Programming and Statistical Problems ⋮ On duality theory of convex semi-infinite programming ⋮ Structure-Preserving Function Approximation via Convex Optimization ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ Generalized semi-infinite programming: numerical aspects ⋮ Strong duality for inexact linear programming ⋮ Second-order nonsmooth optimization for \(H_{\infty}\) synthesis ⋮ A constrained optimum experimental design problem for model discrimination with a continuously varying factor ⋮ Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ A Semi-Infinite Programming Model In Data Envelopment Analysis ⋮ Unnamed Item ⋮ A quasi-Newton interior point method for semi-infinite programming ⋮ Solving generalized semi-infinite programs by reduction to simpler problems ⋮ Algorithms for infinite quadratic programming in \(L_p\) spaces ⋮ Outer approximation schemes for generalized semi-infinite variational inequality problems ⋮ Static arbitrage bounds on basket option prices ⋮ Proximal interior point method for convex semi-infinite programming ⋮ Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems ⋮ On the Bijectivity of Thin-Plate Splines ⋮ Characterizing optimal wages in principal-agent problems without using the first-order approach ⋮ Understanding linear semi-infinite programming via linear programming over cones ⋮ Nonsmooth optimization for multidisk \(H_\infty\) synthesis ⋮ An iterative method for solving KKT system of the semi-infinite programming ⋮ Semi-infinite programming, duality, discretization and optimality conditions† ⋮ Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints ⋮ A reduction method for semi-infinite programming by means of a global stochastic approach† ⋮ On solving a class of linear semi-infinite programming by SDP method ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems ⋮ On the resolution of the Vasicek-type interest rate model ⋮ Duality for semi-definite and semi-infinite programming ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ Global optimization of semi-infinite programs via restriction of the right-hand side ⋮ Interior point filter method for semi-infinite programming problems ⋮ Rate of convergence of a class of numerical methods solving linear inequality systems ⋮ Redundancy in linear inequality system ⋮ On Haar's dual problem ⋮ Path-following proximal approach for solving ill-posed convex semi-infinite programming problems ⋮ Linear convergence of accelerated conditional gradient algorithms in spaces of measures ⋮ Unnamed Item ⋮ Cutting plane algorithms for robust conic convex optimization problems ⋮ Unnamed Item ⋮ Robust stability using interval analysis ⋮ Unnamed Item ⋮ Estimating density functions: a constrained maximum likelihood approach* ⋮ Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions ⋮ On level sets of marginal functions ⋮ A smoothing approach for the optimal parameter selection problem with continuous inequality constraint ⋮ A fast algorithm for the optimal design of high accuracy windows in signal processing ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ On semi-infinite minmax programming with generalized invexity ⋮ A dual parameterization approach to linear-quadratic semi-infinite programming problems ⋮ LP relaxations for a class of linear semi-infinite programming problems ⋮ Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets ⋮ A survey of nonlinear robust optimization ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems ⋮ Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds ⋮ A modified exchange algorithm for distributional robust optimization and applications in risk management ⋮ Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Proper orthogonal decomposition assisted eigendeformation-based mathematical homogenization method for modeling cracks in 3D polycrystalline microstructures ⋮ Variational analysis based on proximal subdifferential on smooth Banach spaces ⋮ Practical algorithms for multivariate rational approximation ⋮ A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming ⋮ Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints ⋮ An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials ⋮ Copositive tensor optimization problem and its applications to hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A METHOD FOR PRICING AMERICAN OPTIONS USING SEMI‐INFINITE LINEAR PROGRAMMING ⋮ On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets ⋮ The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems ⋮ Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme ⋮ Solving fuzzy variational inequalities over a compact set ⋮ Sliding motion, robust control and power loss minimization in a class of non-linear switched converters ⋮ An algorithm constructing solutions for a family of linear semi-infinite problems. ⋮ Transportation interval situations and related games ⋮ Fitting with Matrix-Exponential Distributions ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Duality for inexact semi-infinite linear programming ⋮ Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods ⋮ A semi-infinite programming approach to identifying matrix-exponential distributions ⋮ Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity ⋮ Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints ⋮ Slater Condition for Tangent Derivatives