Roughly speaking, the basic idea behind the so-called minimax method is the following: Find a critical value of a functional ϕ ∈ C1 (X, ℝ) as a minimax (or maximin) value c ∈ ℝ of ϕ over a suitable class A of subsets of X:
$$ c = \mathop {\inf }\limits_{A \in \mathcal{A}} \mathop {\sup }\limits_{u \in A} \phi \left( u \right). $$


Suitable Class Bounded Smooth Domain Bootstrap Argument Minimax Method Strict Local Minimum 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 2007

Authors and Affiliations

  • David G. Costa
    • 1
  1. 1.Department of Mathematical SciencesUniversity of Nevada, Las VegasLas VegasUSA

Personalised recommendations