Necessary conditions for min-max problems and algorithms by a relaxation procedure
From MaRDI portal
Publication:3862012
DOI10.1109/TAC.1980.1102226zbMath0426.49008MaRDI QIDQ3862012
Eitaro Aiyoshi, Kiyotaka Shimizu
Publication date: 1980
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Decision theory (91B06) Existence of solutions for minimax problems (49J35) Numerical methods of relaxation type (49M20)
Related Items
A new expected-improvement algorithm for continuous minimax optimization, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients, Optimal design of experiments via linear programming, An algorithm for minimax, Robust experiment design via maximin optimization, An algorithm based on semidefinite programming for finding minimax optimal designs, Max-min solutions for fuzzy multiobjective matrix games, An optimization approach to robust nonlinear control design, A robust optimization approach to experimental design for model discrimination of dynamical systems, Solutions for fuzzy matrix games, Unnamed Item, Minimax regret solution to linear programming problems with an interval objective function, Optimal designs for comparing curves in regression models with asymmetric errors, Worst-case global optimization of black-box functions through Kriging and relaxation, Global solution of constrained min-max problems with inflationary differential evolution, Continuous models combining slacks-based measures of efficiency and super-efficiency, New necessary and sufficient optimality conditions for strong bilevel programming problems, A new solution to optimization-satisfaction problems by a penalty method, Qualitative and quantitative experiment design for phenomenological models - a survey, Generalized Farkas' theorem and optimization of infinitely constrained problems, Optimum design accounting for the global nonlinear behavior of the model, Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems, A constrained optimum experimental design problem for model discrimination with a continuously varying factor, Construction of T-Optimum Designs for Multiresponse Dynamic Models, Robust optimal experiment design for system identification, A robust lot sizing problem with ill-known demands, A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination, Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion, Portfolio choice and optimal hedging with general risk functions: a simplex-like algorithm, Worst-case estimation for econometric models with unobservable components, A heuristic to minimax absolute regret for linear programs with interval objective function coefficients, Continuous-time fractional minmax programming
