Metraipolis › archive › dc_38f2bd474766
Sliding Methods for Hölder-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling — arXiv:2608.03846
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03846
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:48:29.421Z
- SHA-256 of the archived text
3638b1f152e460cbeb5ba958401db34aa5e4b7175bf395c3088d1c47a0b08a47- Stable URL of this page
https://metraipolis.com/documento/dc_38f2bd474766
How to cite
Sliding Methods for Hölder-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling — arXiv:2608.03846 — arXiv (en), https://arxiv.org/abs/2608.03846 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_38f2bd474766 (Metraipolis archive dc_38f2bd474766, sha256 3638b1f152e460cbeb5ba958401db34aa5e4b7175bf395c3088d1c47a0b08a47)
BibTeX
@misc{dc38f2bd474766,
title = {Sliding Methods for Hölder-Smooth Convex--Concave Minimax Optimization with Bilinear Coupling — arXiv:2608.03846},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03846},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_38f2bd474766; sha256 3638b1f152e460cbeb5ba958401db34aa5e4b7175bf395c3088d1c47a0b08a47},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03846. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study convex-concave minimax optimization problems with bilinear coupling of the form $\min_{x\in \mathcal X}\max_{y\in \mathcal Y} \; f(x)+\langle y,\mathbf{B}x\rangle-g(y),$ where the functions $f$ and $g$ have Hölder continuous (sub)gradients. This setting covers a broad range of regimes, from nonsmooth problems with bounded subgradient variation to smooth problems with Lipschitz continuous gradients; for a smooth component used in the coupling-induced regularizer, its Lipschitz-gradient constant is assumed to hold in the ambient space. We propose a sliding method that exploits the composite structure of the problem by querying the oracles associated with $f$, $g$, and the bilinear coupling operator at prescribed frequencies determined by their individual properties. The method is based on a recursive sliding scheme for monotone variational inequalities. We establish convergence guarantees under Hölder continuity and show how the resulting complexity bounds depend explicitly on the Hölder exponents, Hölder constants, strong convexity parameters, and spectral properties of the coupling matrix. Our analysis covers nonstrongly convex and partially strongly convex regimes. For stochastic function oracles, we prove componentwise Hölder guarantees with separate variance costs: a uniform expected-gap bound on bounded domains and, when both functions are strongly convex on their feasible sets, a restarted Lyapunov guarantee without an anchor noise floor. Numerical experiments reproduce the predicted Hölder exponents and confirm that the number of gradient evaluations required for each function separates according to its own smoothness level rather than the worse of the two. A tomographic benchmark shows runtime gains when gradient evaluations are more expensive than the additional matrix-vector products.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.03846 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T12:35:48.816Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).