scientific article

From MaRDI portal
Revision as of 17:47, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3840143

zbMath0908.90255MaRDI QIDQ3840143

Rembert Reemtsen, Stephan Görner

Publication date: 18 March 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Existence of augmented Lagrange multipliers for semi-infinite programming problems, Generalized corner optimal solution for LSIP: existence and numerical computation, Convergent Algorithms for a Class of Convex Semi-infinite Programs, Solving a class of fuzzy linear programs by using semi-infinite programming techniques, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, Study of a special nonlinear problem arising in convex semi-infinite programming, An entropic regularized method of centers for continuous minimax problem with semi infinite constraints, Feasible Method for Semi-Infinite Programs, Solving variational inequalities defined on a domain with infinitely many linear constraints, Process optimization under uncertainty when there is not enough process data at the operation stage, Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems, Frameworks and results in distributionally robust optimization, Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case, Semi-infinite programming, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, A transformation-based discretization method for solving general semi-infinite optimization problems, Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints, Some properties on quadratic infinite programs of integral type, A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs, The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets, Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems, A modified exchange algorithm for distributional robust optimization and applications in risk management, A lifting method for generalized semi-infinite programs based on lower level Wolfe duality, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Generating valid linear inequalities for nonlinear programs via sums of squares, Unnamed Item, Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method, 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, On the numerical treatment of linearly constrained semi-infinite optimization problems, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, A constrained optimum experimental design problem for model discrimination with a continuously varying factor, 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, Global optimization of generalized semi-infinite programs via restriction of the right hand side, Cascading: An adjusted exchange method for robust conic programming, On the linear convergence rates of exchange and continuous methods for total variation minimization, An alternative characterization for matrix exponential distributions, Necessary conditions and duality for inexact nonlinear semi-infinite programming problems, How to solve a semi-infinite optimization problem, Numerical treatment of Bayesian robustness problems, Solving the 3d Ising model with the conformal bootstrap. II: \(c\)-minimization and precise critical exponents, Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems, Design approximation problems for linear-phase nonrecursive digital filters, New approach for the nonlinear programming with transient stability constraints arising from power systems, An accelerated central cutting plane algorithm for linear semi-infinite programming, Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme, Solving continuous min-max problems by an iterative entropic regularization method., A smoothing Newton method for semi-infinite programming, Duality theorems and algorithms for linear programming in measure spaces, 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, On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems, Global solution of semi-infinite programs with existence constraints, An approach for solving fuzzy implicit variational inequalities with linear membership functions, Solving a class of semi-infinite variational inequality problems via a homotopy method, Worst-case estimation for econometric models with unobservable components, On optimization, dynamics and uncertainty: A tutorial for gene-environment networks, Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions, An inexact primal-dual algorithm for semi-infinite programming, Approximation in normed linear spaces, Linear semi-infinite programming theory: an updated survey, An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions., Process optimization under insufficient experimental information in the phase of service, Problem-based optimal scenario generation and reduction in stochastic programming


Uses Software