A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming (Q732375)

From MaRDI portal





scientific article; zbMATH DE number 5612824
Language Label Description Also known as
default for all languages
No label defined
    English
    A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
    scientific article; zbMATH DE number 5612824

      Statements

      A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming (English)
      0 references
      0 references
      0 references
      9 October 2009
      0 references
      The authors study the semi-infinite minimax optimization nonsmooth problem. The article begins with an overview of this problem and a background to trust region methods, which is followed by an outline of relevant definitions and theorems. The third section of the paper presents the necessary conditions for optimality, which are essential for the fourth section where the main steps of the algorithm and its convergence are presented and proven. The article concludes with a short section on computational results and a list of useful references.
      0 references
      semi-infinite programming
      0 references
      nonsmooth optimization
      0 references
      trust region algorithm
      0 references
      global convergence
      0 references
      numerical examples
      0 references

      Identifiers