Proximal Linearized Iteratively Reweighted Algorithms for Nonconvex and Nonsmooth Optimization Problem

Axioms

Juyeb Yeo¹  Myeongmin Kang¹ 

[1] Department of Mathematics, Chungnam National University, Daejeon 34134, Korea;

关键词: iterative reweighted algorithm;    linearization;    nonconvex optimization;    nonsmooth objective function;    Kurdyka–Łojasiewicz property;   

DOI  :  10.3390/axioms11050201

来源: DOAJ

【 摘 要 】

The nonconvex and nonsmooth optimization problem has been attracting increasing attention in recent years in image processing and machine learning research. The algorithm-based reweighted step has been widely used in many applications. In this paper, we propose a new, extended version of the iterative convex majorization–minimization method (ICMM) for solving a nonconvex and nonsmooth minimization problem, which involves famous iterative reweighted methods. To prove the convergence of the proposed algorithm, we adopt the general unified framework based on the Kurdyka–Łojasiewicz inequality. Numerical experiments validate the effectiveness of the proposed algorithm compared to the existing methods.

【 授权许可】

Unknown