| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4632232 | Applied Mathematics and Computation | 2009 | 7 Pages |
Abstract
Based on the discretization methods for solving semi-infinite programming problems, this paper presents a new nonmonotonic trust region algorithm for a class of semi-infinite minimax programming problem. Under some mild assumptions, the global convergence of the proposed algorithm is given. Numerical tests are reported that show the efficiency of the proposed method.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Ou Yigui, Zhou Qian,