The modified second APG method for a class of nonconvex nonsmooth problems

DOI10.1007/S11590-024-02132-XMaRDI QIDQ6968720zbMATH OpenFDO

Authors Kexin Ren, Chunguang Liu, Lumiao Wang

Publication date 24 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-024-02132-X

zbMATH Keywords

DC functionKurdyka-Łojasiewicz inequalitythe second APG algorithm

Mathematics Subject Classification ID

Numerical methods in optimal control (49Mxx) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites work

• A proximal difference-of-convex algorithm with extrapolation
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
• An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC formulations and algorithms for sparse optimization problems
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
• Introductory lectures on convex optimization. A basic course.
• Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
• Minimization of \(\ell_{1-2}\) for compressed sensing
• On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
• Penalty methods for a class of non-Lipschitz optimization problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Selective <inline-formula> <tex-math notation="TeX">$\ell_{1}$</tex-math></inline-formula> Minimization for Sparse Recovery
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The modified second APG method for DC optimization problems
• The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates

This page was built for publication: The modified second APG method for a class of nonconvex nonsmooth problems

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