TY - JOUR AU - Chunming Tang AU - Huangyue Chen AU - Jinbao Jian PY - 2016/02/28 Y2 - 2024/03/29 TI - An improved partial bundle method for linearly constrained minimax problems JF - Statistics, Optimization & Information Computing JA - Stat., optim. inf. comput. VL - 4 IS - 1 SE - Research Articles DO - 10.19139/soic.v4i1.205 UR - http://iapress.org/index.php/soic/article/view/20160307 AB - In this paper, we propose an improved partial bundle method for solving linearly constrained minimax problems. In order to reduce the number of component function evaluations, we utilize a partial cutting-planes model to substitute for the traditional one. At each iteration, only one quadratic programming subproblem needs to be solved to obtain a new trial point. An improved descent test criterion is introduced to simplify the algorithm. The method produces a sequence of feasible trial points, and ensures that the objective function is monotonically decreasing on the sequence of stability centers. Global convergence of the algorithm is established. Moreover, we utilize the subgradient aggregation strategy to control the size of the bundle and therefore overcome the difficulty of computation and storage. Finally, some preliminary numerical results show that the proposed method is effective. ER -