Results 201 to 210 of about 6,417 (238)
Some of the next articles are maybe not open access.
The segment method as an alternative to minimax in hypothesis testing
Information Sciences, 1982Abstract An alternative approach to the design of hypothesis tests within modeling uncertainty is proposed. This approach is based on a design technique known as the segment method, which has been established previously as a favorable alternative to the minimax concept in the context of optimal control.
Bruce H. Krogh, H. Vincent Poor
openaire +1 more source
Truncated Newton Method for Solving Minimax Problems
2012 Fifth International Joint Conference on Computational Sciences and Optimization, 2012An exact method for solving the problem of minimizing the maximum of a finite number of functions consists of solving a sequence of sub problems when quadratic approximations to the functions are employed in the determination of a search direction. For problems of large size, solving the sub problems exactly can be very expensive.
Junxiang Li, Bo Yu 0003, Shuting Zhang
openaire +1 more source
Minimax Methods for Inequality Problems
2003We know from Chapter 2 that, if we intend to consider concrete problems in unilateral Mechanics involving both monotone and nonmonotone unilateral boundary (or interior) conditions, then we have in general to deal with a nonsmooth and nonconvex energy functional — expressed as the sum of a locally Lipschitz function \(\Phi :X \to \mathbb{R}\) and a ...
D. Goeleven +3 more
openaire +1 more source
An Interior Penalty Method for Minimax Problems with Constraints
SIAM Journal on Control, 1974In this paper the interior penalty function method is applied to the minimax problems. Fiacco and McCormick’s penalty technique is used in order to solve the minimax problems with side constraints.As a result, the constrained minimax problem is reduced to the one solving a sequence of unconstrained approximation problems and a new computational ...
openaire +1 more source
A method of centers algorithm for certain minimax problems
Mathematical Programming, 1982An algorithm is presented for the numerical solution of nonlinear programming problems in which the objective function is to be minimized over feasiblex after having been maximized over feasibley. The vectorsx andy are subjected to separate nonlinear constraints.
openaire +1 more source
Minimax projection method for linear evolution equations
52nd IEEE Conference on Decision and Control, 2013In this paper we present a minimax projection method for linear evolution equations in Hilbert space. The method extends classical Galerkin approach: it builds a differential-algebraic equation with uncertain parameters that models dynamics of exact projection coefficients representing the projection of the evolution equation's solution onto a finite ...
openaire +1 more source
Minimax Methods for Indefinite Functionals.
1984Abstract : This paper contains the written of a series of lectures presented by the author at the American Mathematical Society Summer Institute on Nonlinear Functional Analysis and Nonlinear Differential Equations. These lectures are an introduction to minimax techniques for finding critical points of functionals, especially functionals possessing ...
openaire +1 more source
Minimax Bayes Estimation, Penalized Likelihood Methods, and Restricted Minimax Estimation
1991Suppose, 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