Results 161 to 170 of about 32,351,759 (213)

On penalty methods for minimax problems

Zeitschrift für Operations Research, 1986
Minimax problems play an important role in different fields of nonlinear analysis (game theory, duality theory, fixed point theory). After the introduction of the problem and some of its basic properties the paper investigates penalty methods to solve minimax problems.
openaire   +1 more source

Minimax method of measuring productive efficiency

International Journal of Systems Science, 1988
A class of minimax methods for measuring productive efficiency is proposed here and compared with two other methods currently available in the literature. Some advantages of the minimax methods such as robustness and probability maximization are analysed both theoretically and empirically.
JATI K. SENGUPTA, RAYMOND E. SFEIR
openaire   +1 more source

An Adaptive Smoothing Method for Continuous Minimax Problems [PDF]

Asia-Pacific Journal of Operational Research, 2015
A simple and implementable two-loop smoothing method for semi-infinite minimax problem is given with the discretization parameter and the smoothing parameter being updated adaptively. We prove the global convergence of the algorithm when the steepest descent method or a BFGS type quasi-Newton method is applied to the smooth subproblems.
openaire   +2 more sources

Spectral methods in linear minimax estimation

Acta Applicandae Mathematicae, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A New Method for the Multifacility Minimax Location Problem

Journal of the Operational Research Society, 1978
This paper presents a new method of locating n new facilities among m destinations in accordance with the minimax criterion; that is, the facilities are located to minimize the maximum weighted distance in the system. Distances may be rectangular, Euclidean, or general (lp).
Drezner, Z., Wesolowsky, G. O.
openaire   +3 more sources

Minimax Bayes Estimation, Penalized Likelihood Methods, and Restricted Minimax Estimation

1991
Suppose, based on n data points, one wishes to estimate an n-dimensional vector \({\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{\theta }}\) (e.g. one wishes to estimate \(g({{{\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{t}}}_{i}}),{{{\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{t}}}_{i}}
openaire   +1 more source

Iterative methods for solving minimax problems

USSR Computational Mathematics and Mathematical Physics, 1974
Abstract THE ITERATIVE methods are described, and their convergence to a local solution of a minimax problem is proved. The conditions for their convergence to the global solution are obtained. It is shown that the methods may be used to find saddle points.
openaire   +2 more sources

Research for AQM based on MiniMax method

Neural Computing and Applications, 2014
This paper proposes an active queue management (AQM) controller for a class of linearized congestion router network systems in the presence of unknown time-varying link number and disturbances. Based on the idea of MiniMax method in game theory, a novel output feedback controller is specially designed with the improved robustness to the disturbances ...
Xudong Yuan, Yuanwei Jing
openaire   +1 more source

A barrier function method for minimax problems

Mathematical Programming, 1992
The authors consider the optimization problem to minimize \(\psi(x)\) on \(\mathbb{R}^ n\) where \[ \psi(x):=\max\left(f^ 1(x),\dots,f^ m(x), \max_{t\in[0,1]}\Phi^ 1(x,t),\dots,\max_{t\in[0,1]}\Phi^ \ell(x,t)\right) \] and \(f^ j\), \(j=1,\dots,m\), \(\Phi^ k\), \(k=1,\dots,\ell\), are continuously differentiable functions.
Polak, E., Higgins, J. E., Mayne, D. Q.
openaire   +2 more sources

Minimax Methods for Variational-Hemivariational Inequalities

1999
The topic of this chapter is the critical point theory for the functionals that are not locally Lipschitz as was the case in Chatper 2. The setting is more general than in Chatper 2, and the results contain those in Chang [2]. In fact, this chapter presents an extension of Szulkin’s minimax principles [32] for functions of the form I = Φ + Ψ with Φ ∈ C
D. Motreanu, P. D. Panagiotopoulos
openaire   +1 more source