An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
Open Access
- 20 February 2024
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 88 (2) , 603-641
Abstract
This paper focuses on the minimization of a sum of a twice continuously differentiable function f and a nonsmooth convex function. An inexact regularized proximal Newton method is proposed by an approximation to the Hessian of f involving the $$\varrho $$ th power of the KKT residual. For $$\varrho =0$$ , we justify the global convergence of the iterate sequence for the KL objective function and its R-linear convergence rate for the KL objective function of exponent 1/2. For $$\varrho \in (0,1)$$ , by assuming that cluster points satisfy a locally Hölderian error bound of order q on a second-order stationary point set and a local error bound of order $$q>1\!+\!\varrho $$ on the common stationary point set, respectively, we establish the global convergence of the iterate sequence and its superlinear convergence rate with order depending on q and $$\varrho $$ . A dual semismooth Newton augmented Lagrangian method is also developed for seeking an inexact minimizer of subproblems. Numerical comparisons with two state-of-the-art methods on $$\ell _1$$ -regularized Student’s t-regressions, group penalized Student’s t-regressions, and nonconvex image restoration confirm the efficiency of the proposed method.
Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (12371299)
- Research Grants Council of Hong Kong (PolyU 152182/19E)
This publication has 50 references indexed in Scilit:
- Robust inversion, dimensionality reduction, and randomized samplingMathematical Programming, 2012
- Hölder Metric Subregularity with Applications to Proximal Point MethodSIAM Journal on Optimization, 2012
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- An efficient DC programming approach for portfolio decision with higher momentsComputational Optimization and Applications, 2010
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007
- Tame functions are semismoothMathematical Programming, 2007
- Error bounds for systems of lower semicontinuous functions in Asplund spacesMathematical Programming, 2007
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic featuresMathematical Programming, 2007
- Local behavior of an iterative framework for generalized equations with nonisolated solutionsMathematical Programming, 2002
- Error bounds and convergence analysis of feasible descent methods: a general approachAnnals of Operations Research, 1993