Metraipolis › archive › dc_9da9d76e4152

Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems — arXiv:2608.29300

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29300
License (as archived)
CC0-1.0
Archived
2026-10-17T09:02:49.513Z
SHA-256 of the archived text
4cf67f6f8a61520cbddf884d73c4eb994178786086c7c5706f250c5cf1fa34b1
Stable URL of this page
https://metraipolis.com/documento/dc_9da9d76e4152

How to cite

Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems — arXiv:2608.29300 — arXiv (en), https://arxiv.org/abs/2608.29300 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9da9d76e4152 (Metraipolis archive dc_9da9d76e4152, sha256 4cf67f6f8a61520cbddf884d73c4eb994178786086c7c5706f250c5cf1fa34b1)
BibTeX
@misc{dc9da9d76e4152,
  title = {Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems — arXiv:2608.29300},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29300},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9da9d76e4152; sha256 4cf67f6f8a61520cbddf884d73c4eb994178786086c7c5706f250c5cf1fa34b1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29300. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 initial L-BFGS metric; it combines component-gradient Lipschitz curvature with the curvature induced by the hyperbolic smoothing Jacobian, is uniformly positive definite, and provably majorizes the Hessian of the smoothed objective. To exploit strict negative secant curvature, three correction strategies are introduced---direct sign reflection, a Euclidean nearest-point correction, and a $B_k^{-1}$-metric nearest-point correction---for which explicit formulas are derived and Clarke-stationary accumulation points are obtained for the idealized continuation. For a fixed smoothing parameter, Q-linear convergence of the HMLBFGS objective values is obtained under a Polyak--Lojasiewicz condition, local strong convexity further yields R-linear convergence of the iterates, and the corresponding full-memory modified BFGS methods attain local Q-superlinear convergence under the usual unit-step assumptions. Numerical experiments demonstrate the effectiveness of the proposed preconditioned methods and their numerical advantages over the selected comparison methods.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.29300 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T08:40:19.736Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).