arXiv (All)
open access
Efficient Parameter-Free First-Order Methods for Nonsmooth Composite Minimax Optimization
In this paper we propose first-order methods for a class of nonsmooth composite strongly convex--strongly concave and nonconvex--concave minimax optimization. We first develop an inexact proximal method and an accumulative regularizated method for strongly convex--strongly concave problems. The latt
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An inexact variable metric proximal linearization method for composite optimization on manifolds#1156203
- Envelopt: Constrained Convex Composite Optimization#1077449
- Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems#1083257
- A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944
- Near-Optimal Pure Single-Loop Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization#1034092
Record · ID 1061385
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive