A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
type: Item
instance of: scholarly article
title: A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
zbMATH Open document ID: 1180.65080
author: Qian Zhou
author: Yigui Ou
published in: Applied Mathematics and Computation
publication date: 2009-10-09T00:00:00Z
review text: 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.
reviewed by: Efstratios Rappos
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5612824
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: trust region algorithm
zbMATH Keywords: global convergence
zbMATH Keywords: numerical examples
MaRDI profile type: Publication
full work available at URL: j.amc.2009.05.009
OpenAlex ID: W1967831733
cites work: Optimization. Algorithms and consistent approximations
cites work: Q4238199
cites work: On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
cites work: An implementation of a discretization method for semi-infinite programming
cites work: Optimization theory and methods. Nonlinear programming
cites work: Nonmonotone trust region method for solving optimization problems
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: An unconstrained optimization method using nonmonotone second order Goldstein's line search
cites work: Nonmonotone adaptive trust-region method for unconstrained optimization problems
cites work: Q4000274
cites work: Sufficient conditions for extremum, penalty functions and regularity
cites work: Q4407181
DOI: 10.1016/J.AMC.2009.05.009
Recommended article: Q4384508
Recommended article: A class of nonmonotone trust region algorithms for constrained optimizations
Recommended article: A class of nonmonotone trust region algorithms for unconstrained optimization problems
Recommended article: Q3170666
Recommended article: A nonmonotone trust region algorithm for unconstrained nonsmooth optimization
Recommended article: Q5699377
Recommended article: A trust region method for semi-infinite programming problems
Recommended article: Q4709692
Recommended article: A nonmonotonic trust region method for constrained optimization problems
Recommended article: Q4407181
description: scientific article; zbMATH DE number 5612824