Next-Generation Iterative Algorithms for Large-Scale Min-Max Optimization: Design and Analysis
Abstract
This thesis investigates the design of algorithms for solving min-max optimization problems, which form the mathematical foundation of many modern applications in machine learning, game theory, and optimization. This work offers new theoretical insights and practical algorithms that address the limitations of existing methods in various problem settings.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.