Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems.
Pouria MahdaviniaYuyang DengHaochuan LiMehrdad MahdaviPublished in: CoRR (2022)
Keyphrases
- difficult problems
- practical problems
- genetic algorithm
- analytical methods
- statistical analysis
- optimization problems
- computational cost
- preprocessing
- significant improvement
- lower bound
- steepest ascent
- empirical studies
- methods can be applied
- gradient information
- search methods
- problems in computer vision
- decision trees
- image processing
- image gradient
- image restoration and reconstruction
- neural network
- alternative methods
- heuristic methods
- benchmark datasets
- data analysis
- np complete
- worst case
- feature space