Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Inexact Proximal Newton Method for Nonconvex Composite Minimization (2412.16535v1)

Published 21 Dec 2024 in math.OC

Abstract: In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k{-1/2})$ in terms of the minimal norm of the KKT residual mapping and the local superlinear convergence rate in terms of the sequence generated by the proposed algorithm under the higher-order metric $q$-subregularity property. When the Lipschitz constant of the corresponding gradient is known, we show that the proposed algorithm is well-defined without line search. Extensive numerical experiments on the $\ell_1$-regularized Student's $t$-regression and the group penalized Student's $t$-regression show that the performance of the proposed method is comparable to the state-of-the-art proximal Newton-type methods.

Summary

We haven't generated a summary for this paper yet.