An accelerated preconditioned primal-dual gradient algorithm for structured nonconvex optimization problems

DOI10.1016/J.CNSNS.2025.109480MaRDI QIDQ6874347zbMATH OpenFDO

Authors X. J. Long, Jia-Lin Nie, Zhun Gou, X. K. Sun, Gaoxi Li

Publication date 15 January 2026

Published in Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CNSNS.2025.109480

zbMATH Keywords

global convergenceconjugate duality theoryprimal-dual gradient algorithmKurdyka-Łojasiewicz propertystructured nonconvex and nonsmooth problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
• A proximal splitting algorithm for generalized DC programming with applications in signal recovery
• A weighted difference of anisotropic and isotropic total variation model for image processing
• Certifiably optimal sparse principal component analysis
• Compressed sensing
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• First-order methods in optimization
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
• Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
• Orthogonal nonnegative matrix factorization by sparsity and nuclear norm optimization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
• Variational Analysis
• iPiano: inertial proximal algorithm for nonconvex optimization
• iPiasco: inertial proximal algorithm for strongly convex optimization

Cited in

(1)

• Variable smoothing alternating proximal gradient algorithm for coupled composite optimization

This page was built for publication: An accelerated preconditioned primal-dual gradient algorithm for structured nonconvex optimization problems

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