An accelerated first-order method with complexity analysis for solving cubic regularization subproblems

Rujun Jiang (), Man-Chung Yue () and Zhishuo Zhou ()
Additional contact information
Rujun Jiang: Fudan University
Man-Chung Yue: The Hong Kong Polytechnic University
Zhishuo Zhou: Fudan University

Computational Optimization and Applications, 2021, vol. 79, issue 2, No 8, 506 pages

Abstract: Abstract We propose a first-order method to solve the cubic regularization subproblem (CRS) based on a novel reformulation. The reformulation is a constrained convex optimization problem whose feasible region admits an easily computable projection. Our reformulation requires computing the minimum eigenvalue of the Hessian. To avoid the expensive computation of the exact minimum eigenvalue, we develop a surrogate problem to the reformulation where the exact minimum eigenvalue is replaced with an approximate one. We then apply first-order methods such as the Nesterov’s accelerated projected gradient method (APG) and projected Barzilai-Borwein method to solve the surrogate problem. As our main theoretical contribution, we show that when an $$\epsilon$$ ϵ -approximate minimum eigenvalue is computed by the Lanczos method and the surrogate problem is approximately solved by APG, our approach returns an $$\epsilon$$ ϵ -approximate solution to CRS in $${\tilde{O}}(\epsilon ^{-1/2})$$ O ~ ( ϵ - 1 / 2 ) matrix-vector multiplications (where $${\tilde{O}}(\cdot )$$ O ~ ( · ) hides the logarithmic factors). Numerical experiments show that our methods are comparable to and outperform the Krylov subspace method in the easy and hard cases, respectively. We further implement our methods as subproblem solvers of adaptive cubic regularization methods, and numerical results show that our algorithms are comparable to the state-of-the-art algorithms.

Keywords: Cubic regularization subproblem; First-order methods; Constrained convex optimization; Complexity analysis (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-021-00274-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:79:y:2021:i:2:d:10.1007_s10589-021-00274-7

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-021-00274-7

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().