Operations Research Transactions ›› 2022, Vol. 26 ›› Issue (4): 64-74.doi: 10.15960/j.cnki.issn.1007-6093.2022.04.005

Previous Articles     Next Articles

Block alternating proximal gradient algorithm for convex-nonconcave minimax problems

ZHANG Huiling, XU Yang, XU Zi*   

  1. College of Sciences, ShanghaiUniversity, Shanghai 200444, China
  • Received:2020-10-26 Published:2022-11-28

Abstract: This paper proposes a single-loop block-alternating proximal gradient algorithm to solve block convex-nonconcave minimax optimization problems. In each iteration of the algorithm, the proximal gradient method is used to alternately update each variable in the objective function. We have theoretically proved that the algorithm achieves an ε-stationary point in O(ε-4) iterations. To the best of our knowledge, this is the first time that a single loop algorithm has been proposed to solve a block convexnonconcave minimax optimization problem.

Key words: minimax optimization problem, machine learning, alternating proximal gradient method

CLC Number: