arXiv (OAI Expanded)
open access
Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems
This paper develops a hyperbolic-majorization preconditioned three-term nonlinear conjugate-gradient framework for nonconvex finite minimax optimization. An analytic symmetric positive definite metric is derived from a global quadratic majorization of the hyperbolic smoothing model and is used simul
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
- Efficient Parameter-Free First-Order Methods for Nonsmooth Composite Minimax Optimization#1061385
- A proximal linearized NEP method for composite optimization with conic and manifold constraints#1084509
- Sharp Minimax Rates for Highly Smooth Strongly Convex Zeroth-Order Optimization#1154899
- TIGER: Inverting Transformer Gradients via Embedding-Subspace Distance Optimization#287080
- Nonmonotone subgradient methods based on a local descent lemma#1141448
Record · ID 1083257
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