arXiv (All)
open access
A sequential smoothing majorant stochastic approximation method for nonconvex nonconcave minimax problems
We propose a sequential smoothing majorant stochastic approximation (SMSA) method for nonconvex-nonconcave minimax optimization problems. To overcome the nonconcavity of the inner maximization problem, we introduce a new majorant stochastic approximation with an $O\left(β_N^2\right)$ accuracy bound,
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
- A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization#160891
- Computation of Strong Solutions to Stochastic Variational Inequalities#927051
- A Gaussian upper bound for Gaussian multi-stage stochastic linear programs#429964
- To Solve Bilevel Optimization with Nonconvex Lower Levels, We Need Second-Order Stationarity#1104700
- Optimal Stochastic Bilevel Optimization with First-Order Oracles#1157114
Record · ID 998722
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