Details

Autor(en) / Beteiligte

• Pham, Tan Nhat
• Dao, Minh N.
• Shah, Rakibuzzaman
• Sultanova, Nargiz
• Li, Guoyin
• Islam, Syed

Titel

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems

Ist Teil von

• Numerical algorithms, 2023-12, Vol.94 (4), p.1763-1795

Ort / Verlag

New York: Springer US

Erscheinungsjahr

2023

Link zum Volltext

Quelle

SpringerLink Journals

Beschreibungen/Notizen

• In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex function and a differentiable function with Lipschitz continuous gradient, subtracted by a weakly convex function. This general framework allows us to tackle problems involving nonconvex loss functions and problems with specific nonconvex constraints, and it has many applications such as signal recovery, compressed sensing, and optimal power flow distribution. We develop a proximal subgradient algorithm with extrapolation for solving these problems with guaranteed subsequential convergence to a stationary point. The convergence of the whole sequence generated by our algorithm is also established under the widely used Kurdyka–Łojasiewicz property. To illustrate the promising numerical performance of the proposed algorithm, we conduct numerical experiments on two important nonconvex models. These include a compressed sensing problem with a nonconvex regularization and an optimal power flow problem with distributed energy resources.