Publications
Sort:
Open Access Research Article Issue
An inertial generalized iteratively reweighted 1 algorithm for nonconvex and nonsmooth optimization
AIMS Mathematics 2026, 11(6): 16414-16447
Published: 15 June 2026
Abstract PDF (2.4 MB) Collect
Downloads:0

We study a class of nonconvex and nonsmooth optimization problems arising in sparse recovery and related applications, which are often addressed using iteratively reweighted 1 (IRL1)-type algorithms. Classical IRL1 methods are typically developed under a Lipschitz gradient assumption, which may limit their applicability. In this paper, we propose a generalized iteratively reweighted 1 algorithm with inertial extrapolation (GIRL1E), where the generalization is based on a co-coercivity condition imposed on the smooth component, thereby allowing a broader class of problems to be treated. By integrating inertial extrapolation into the generalized IRL1 framework, we establish global convergence of the proposed algorithm to a critical point of the objective function. In particular, we prove a sufficient descent property of an associated Lyapunov function and the convergence of the entire sequence without assuming convexity. Numerical experiments on compressive sensing-based signal recovery and image deblurring demonstrated that GIRL1E consistently achieves improved practical performance compared with existing IRL1 methods.

Open Access Research Article Issue
A nonconvex total variational model for the joint image segmentation and restoration of images corrupted by Rician noise
AIMS Mathematics 2026, 11(2): 3594-3635
Published: 06 February 2026
Abstract PDF (4.7 MB) Collect
Downloads:5

In this paper, a novel variational model is proposed for image segmentation via joint restoration of images corrupted by blurring and Rician noise. The proposed model is built upon the piecewise constant Mumford–Shah framework and combines an appropriate data fidelity term with nonconvex total variation (NTV) regularization. The NTV regularization effectively denoises homogeneous regions while accurately preserving object boundaries to facilitate robust segmentation. To solve the resulting nonconvex optimization problem, a proximal alternating minimization algorithm is employed. In addition, an iteratively reweighted 1 algorithm and the alternating direction method of multipliers are adopted to efficiently handle the corresponding subproblems. Numerical experiments demonstrate the effectiveness of the proposed model in achieving accurate and robust segmentation performance when compared with several state-of-the-art methods.

Total 2