arXiv (OAI Expanded)
open access
Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems
This paper proposes a preconditioned ordinary hyperbolic smoothing modified L-BFGS framework for finite minimax problems. To mitigate the deterioration of Euclidean conditioning as the smoothing parameter decreases, a problem-derived hyperbolic majorization preconditioner is incorporated into the in
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
- Unrolling Iterative Lanczos Algorithm for Ideal Low-pass Graph Filter Approximation#1077015
- Regularization and complexity control in feed-forward networks#230055
- RL-PLUS: Countering Capability Boundary Collapse of LLMs in Reinforcement Learning with Hybrid-policy Optimization#144336
- Algorithmic Aspects in Partially Observable Stochastic Games#202566
- Near term algorithms for linear systems of equations#289699
Record · ID 1084347
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