Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems
Abstract
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 Bk−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.
Related
- Modified Decomposition Algorithms for Fractional Delay Boundary Value Problems
- Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems
- Preconditioned Latent Variable Proximal Point Method for Optimal Control Problems with Control Constraints
- A Preconditioned Semismooth Newton Method for Box-Constrained Elliptic Optimal Control Problems with Random Coefficients
- A sequential smoothing majorant stochastic approximation method for nonconvex nonconcave minimax problems
BibTeX
@misc{zhao2026preconditioned,
title = {{Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems}},
author = {Wenzhe Zhao},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2608.29300},
eprint = {2608.29300},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.29300},
}
RIS
TY - UNPB
TI - Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems
AU - Wenzhe Zhao
PY - 2026
DA - 2026/09/14
PB - arXiv
DO - 10.48550/arxiv.2608.29300
UR - https://arxiv.org/abs/2608.29300
AB - 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.
ER -