Necessary conditions for min-max problems and algorithms by a relaxation procedure
From MaRDI portal
Publication:3862012
DOI10.1109/TAC.1980.1102226zbMATH Open0426.49008MaRDI QIDQ3862012FDOQ3862012
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)
Cited In (33)
- Robust experiment design via maximin optimization
- A robust lot sizing problem with ill-known demands
- Title not available (Why is that?)
- Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
- An algorithm for minimax
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A new expected-improvement algorithm for continuous minimax optimization
- A constrained optimum experimental design problem for model discrimination with a continuously varying factor
- Global solution of constrained min-max problems with inflationary differential evolution
- Continuous models combining slacks-based measures of efficiency and super-efficiency
- Minimax regret solution to linear programming problems with an interval objective function
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination
- Optimal designs for comparing curves in regression models with asymmetric errors
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
- An algorithm based on semidefinite programming for finding minimax optimal designs
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- Optimum design accounting for the global nonlinear behavior of the model
- Solutions for fuzzy matrix games
- Worst-case estimation for econometric models with unobservable components
- A new solution to optimization-satisfaction problems by a penalty method
- Construction of T-Optimum Designs for Multiresponse Dynamic Models
- Worst-case global optimization of black-box functions through Kriging and relaxation
- Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems
- Qualitative and quantitative experiment design for phenomenological models - a survey
- An optimization approach to robust nonlinear control design
- Robust optimal experiment design for system identification
- Max-min solutions for fuzzy multiobjective matrix games
- Continuous-time fractional minmax programming
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- Optimal design of experiments via linear programming
- A robust optimization approach to experimental design for model discrimination of dynamical systems
- Generalized Farkas' theorem and optimization of infinitely constrained problems
- Portfolio choice and optimal hedging with general risk functions: a simplex-like algorithm
This page was built for publication: Necessary conditions for min-max problems and algorithms by a relaxation procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3862012)