The following pages link to Semi-infinite programming (Q869581):
Displaying 50 items.
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
- Necessary optimality conditions for a nonsmooth semi-infinite programming problem (Q2423798) (← links)
- Copositive programming via semi-infinite optimization (Q2435031) (← links)
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
- Optimality conditions for nonsmooth semi-infinite multiobjective programming (Q2448217) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Nonsmooth semi-infinite programming problems with mixed constraints (Q2518285) (← links)
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity (Q2656887) (← links)
- A transformation-based discretization method for solving general semi-infinite optimization problems (Q2661756) (← links)
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints (Q2664250) (← links)
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM (Q2681381) (← links)
- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints (Q2689861) (← links)
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions (Q2691484) (← links)
- On the 1962-1972 decade of semi-infinite programming: a subjective view. (Q2776644) (← links)
- Optimization under uncertainty and linear semi-infinite programming: a survey. (Q2776659) (← links)
- Optimality conditions for non-smooth semi-infinite programming (Q2786319) (← links)
- Asymptotic optimality conditions for linear semi-infinite programming (Q2790886) (← links)
- Lower level duality and the global solution of generalized semi-infinite programs (Q2810114) (← links)
- The Worst-Case DFT Filter Bank Design with Subchannel Variations (Q2956395) (← links)
- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs (Q2971158) (← links)
- Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← links)
- Interior point filter method for semi-infinite programming problems (Q3111139) (← links)
- Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems (Q3298015) (← links)
- On the Derivation of Continuous Piecewise Linear Approximating Functions (Q3386781) (← links)
- Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints (Q3388451) (← links)
- Monotone Smoothing Splines using General Linear Systems (Q3454401) (← links)
- Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
- Semi-infinite programming, duality, discretization and optimality conditions† (Q3622011) (← links)
- A software package for semi-infinite optimization (Q3973312) (← links)
- (Q4238199) (← links)
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces (Q4577185) (← links)
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (Q4639127) (← links)
- Optimality, scalarization and duality in linear vector semi-infinite programming (Q4643678) (← links)
- Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions (Q4987689) (← links)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
- On equivalent representations and properties of faces of the cone of copositive matrices (Q5044098) (← links)
- Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function (Q5045173) (← links)
- A tight smooth approximation of the maximum function and its applications (Q5055095) (← links)
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence (Q5093681) (← links)
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty (Q5121777) (← links)
- Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity (Q5157459) (← links)
- Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods (Q5231667) (← links)
- Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions (Q5231682) (← links)
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (<i>p</i>,<i>r</i>)-Invexity (Q5251572) (← links)
- Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints (Q5264008) (← links)
- LP relaxations for a class of linear semi-infinite programming problems (Q5277959) (← links)
- Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming (Q5355202) (← links)
- Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming (Q5857290) (← links)
- Slater Condition for Tangent Derivatives (Q5870376) (← links)
- A stochastic approximation method for convex programming with many semidefinite constraints (Q5882223) (← links)
