lxy
max
The problem(1) with µy > 0 is called a weakly convex-strongly concave(WCSC) saddle-point problem, whereas forµy =0,itiscalledaweakly convex-merely concave(WCMC) saddle-point problem.
Country:
- North America > United States > Pennsylvania > Philadelphia County > Philadelphia (0.04)
- North America > United States > New Jersey > Middlesex County > Piscataway (0.04)
- Asia > Middle East > Jordan (0.04)
ImprovedAlgorithmsforConvex-Concave MinimaxOptimization
This paper studies minimax optimization problemsminxmaxyf(x,y), where f(x,y) is mx-strongly convex with respect tox, my-strongly concave with respect to y and (Lx,Lxy,Ly)-smooth. Zhang et al. [42] provided the following lower bound of the gradient complexity for any first-order method: Ω q
Country:
- North America > Canada > British Columbia > Metro Vancouver Regional District > Vancouver (0.04)
- Europe > Austria > Styria > Graz (0.04)
- Asia > Middle East > Jordan (0.04)
- (2 more...)