Publication:3840143
From MaRDI portal
zbMath0908.90255MaRDI QIDQ3840143
Stephan Görner, Rembert Reemtsen
Publication date: 18 March 1999
discretization; level sets; Chebyshev approximation; local reduction; smooth semi-infinite programming
90C34: Semi-infinite programming
Related Items
Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme, Design approximation problems for linear-phase nonrecursive digital filters, Solving continuous min-max problems by an iterative entropic regularization method., Process optimization under uncertainty when there is not enough process data at the operation stage, Semi-infinite programming, Some properties on quadratic infinite programs of integral type, Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming, Generalized semi-infinite programming: a tutorial, Stability of the intersection of solution sets of semi-infinite systems, A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints, The semismooth approach for semi-infinite programming under the reduction ansatz, Smoothing by mollifiers. I: Semi-infinite optimization, Cascading: An adjusted exchange method for robust conic programming, An approach for solving fuzzy implicit variational inequalities with linear membership functions, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, Approximation in normed linear spaces, An accelerated central cutting plane algorithm for linear semi-infinite programming, A smoothing Newton method for semi-infinite programming, Duality theorems and algorithms for linear programming in measure spaces, On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems, Linear semi-infinite programming theory: an updated survey, An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions., Solving a class of fuzzy linear programs by using semi-infinite programming techniques, Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method, On the numerical treatment of linearly constrained semi-infinite optimization problems, A constrained optimum experimental design problem for model discrimination with a continuously varying factor, Necessary conditions and duality for inexact nonlinear semi-infinite programming problems, Process optimization under insufficient experimental information in the phase of service, Solving variational inequalities defined on a domain with infinitely many linear constraints
Uses Software
