A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem

This paper studies how to compute global minimizers of the cubic-quartic regularization (CQR) problem $$\underset{s\in {\mathbb{R}}^n}{\min }{f}_0+g^{T}s+\frac{1}{2}{s}^{T}Hs+\frac{\beta }{6}\mathrm{\parallel }s{\mathrm{\parallel }}^3+\frac{\sigma }{4}\mathrm{\parallel }s{\mathrm{\parallel }}^4,$$ where $f_0$ is a constant, $g$ is an $n$-dimensional vector, $H$ is a $n$-by-$n$ symmetric matrix, and $\mathrm{\parallel }s\mathrm{\parallel }$ denotes the Euclidean norm of $s$. The parameter $\sigma \ge 0$ while $\beta$ can have any sign. The CQR problem arises as a critical subproblem for getting efficient regularization methods for solving unconstrained nonlinear optimization. Its properties are recently well studied by Cartis and Zhu [cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods, Math. Program, 2025]. However, a practical method for computing global minimizers of the CQR problem still remains elusive. To this end, we propose a semidefinite programming (SDP) relaxation method for solving the CQR problem globally. First, we show that our SDP relaxation is tight if and only if $\mathrm{\parallel }{s}^{\ast }\mathrm{\parallel }(\beta +3\sigma \mathrm{\parallel }{s}^{\ast }\mathrm{\parallel })\ge 0$ holds for a global minimizer $s^{\ast }$. In particular, if either $\beta \ge 0$ or $H$ has a nonpositive eigenvalue, then the SDP relaxation is shown to be tight. Second, we show that all nonzero global minimizers have the same length for the tight case. Third, we give an algorithm to detect tightness and to obtain the set of all global minimizers. Numerical experiments demonstrate that our SDP relaxation method is both effective and computationally efficient, providing the first practical method for globally solving the CQR problem.