Optimal (N-1)-step fixed-point algorithms correspond exactly to (N-1)! arc diagrams that support composition, decomposition, and H-duality while producing new quasi-anytime optimal methods.
Fast extra gradient methods for smooth structured nonconvex-nonconcave minimax problems.Neural Information Processing Systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
Optimal (N-1)-step fixed-point algorithms correspond exactly to (N-1)! arc diagrams that support composition, decomposition, and H-duality while producing new quasi-anytime optimal methods.