arXiv (All)
open access
Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm
This study explores the performance of the random Gaussian smoothing Zeroth-Order ExtraGradient (ZO-EG) scheme considering \Af{deterministic} min-max optimisation problems with possibly NonConvex-NonConcave (NC-NC) objective functions. We consider both unconstrained and constrained, differentiable a
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
- Sharp Minimax Rates for Highly Smooth Strongly Convex Zeroth-Order Optimization#1154899
- Sampled-Max Subgradient Method for Convex Finite-Max Optimization#1117585
- The Complexity of Convex Optimization with Mismatched Geometry#1117622
- Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems#1083257
- ADMM and Linearized ADMM for Weakly Convex Minimization#1000133
Record · ID 999651
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