Abstract
In this paper, we proposed an adaptive QP-free method without a penalty function or a filter for minimax optimization. In each iteration, solved two linear systems of equations constructed from Lagrange multipliers and KKT-conditioned NCP functions. Based on the work set, the computational scale is further reduced. Instead of the filter structure, we adopt a nonmonotonic equilibrium mechanism with an adaptive parameter adjusted according to the result of each iteration. Feasibility of the algorithm are given, and the convergence under some assumptions is demonstrated. Numerical results and practical application are reported at the end.
Funder
Natural Science Foundation of Hebei Province
Major Basic Research Project of the Natural Science Foundation of the Jiangsu Higher Education Institutions
Publisher
Public Library of Science (PLoS)
Reference22 articles.
1. A derivative-free approximate gradient sampling algorithm for finite minimax problems;W. Hare;Comput Optim Appl,2013
2. A partially inexact bundle method for convex semi-infinite minmax problems;F. Antonio;Communications in Nonlinear Science and Numerical Simulation,2015
3. The Subgradient Method
4. A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints;G Ma;J Inequal Appl,2017