Complexity of trust-region methods with potentially unbounded Hessian approximations for smooth and nonsmooth optimization

• 成果类型: Article; Early Access
• 署名作者: Leconte, Geoffroy; Orban, Dominique
• 署名单位: Universite de Montreal; Polytechnique Montreal; Universite de Montreal; Polytechnique Montreal
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610; 1436-4646
• DOI: 10.1007/s10107-025-02304-2
• 发表日期: 2026-01-26
• 关键词: global convergence; nonconvex minimization; cubic-regularization; algorithms; bounds

摘要

We develop a worst-case evaluation complexity bound for trust-region methods in the presence of unbounded Hessian approximations. We use the algorithm of Aravkin et al. (SIAM J Optim 32(2):900-929, 2022) as a model, which is designed for nonsmooth regularized problems, but applies to unconstrained smooth problems as a special case. Our analysis assumes that the growth of the Hessian approximation is controlled by the number of successful iterations. We show that the best known complexity bound of is an element of(-2) deteriorates to is an element of(-2/(1-p)), where 0 5 p <= 1 is a parameter that controls the growth of the Hessian approximation. The faster the Hessian approximation grows, the more the bound deteriorates. We construct an objective that satisfies all of our assumptions and for which our complexity bound is attained, which establishes that our bound is sharp. To the best of our knowledge, our complexity result is the first to consider potentially unbounded Hessians and is a first step towards addressing a conjecture of Powell (IMA J Numer Anal 30(1):289-301, 2010) that trust-region methods may require an exponential number of iterations in such a case. Numerical experiments conducted in double precision arithmetic are consistent with the analysis.