A Primal-Dual Smoothing Framework for Max-Structured Non-Convex Optimization: The Framework Returns an ε-Near-Stationary Point Within an Explicit Number of IterationsResearch Paper
Many problems in robust optimization, adversarial learning, distributionally robust learning and min-max games have the max-structured form