Double-inertial proximal gradient algorithm for difference-of-convex programming

MaRDI QIDQ5070418zbMATH OpenFDO

Authors Tanxing Wang, Xue Gao, Xing-Ju Cai, Yongzhong Song

Publication date 11 April 2022

Full work available at URL http://yokohamapublishers.jp/online2/oppjo/vol18/p415.html

zbMATH Keywords

difference-of-convex programmingproximal gradient algorithmKurdyka-Łojasiewicz propertydouble-inertial

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29)

Recommendations

• A general double-proximal gradient algorithm for d.c. programming
• An accelerated proximal algorithm for the difference of convex programming
• An inertial algorithm for DC programming
• Double inertial proximal gradient algorithms for convex optimization problems and applications
• A refined inertial DC algorithm for DC programming

Cited in

(5)

• A refined inertial DC algorithm for DC programming
• An inertial algorithm for DC programming
• A general double-proximal gradient algorithm for d.c. programming
• General inertial proximal gradient method with gradient extrapolation for nonconvex nonsmooth optimization problems
• General inertial proximal DC algorithm for three block nonsmooth DC optimization problems

This page was built for publication: Double-inertial proximal gradient algorithm for difference-of-convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070418)