Variable smoothing alternating proximal gradient algorithm for coupled composite optimization

DOI10.1007/S10957-026-02966-8MaRDI QIDQ6834790zbMATH OpenFDO

Authors X. J. Long, Kang Zeng, Gaoxi Li, Minh N. Dao, Zaiyun Peng

Publication date 31 March 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-026-02966-8

zbMATH Keywords

alternating proximal gradientcomplexitynonconvex nonsmooth optimizationvariable smoothingweakly convex function

Mathematics Subject Classification ID

Stochastic programming (90C15) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
• A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis
• A variable smoothing algorithm for solving convex optimization problems
• An accelerated preconditioned primal-dual gradient algorithm for structured nonconvex optimization problems
• Analysis of a new BFGS algorithm and conjugate gradient algorithms and their applications in image restoration and machine learning
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Compressed sensing
• 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
• Deep block proximal linearized minimization algorithm for nonconvex inverse problems
• Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• iPiano: inertial proximal algorithm for nonconvex optimization
• iPiasco: inertial proximal algorithm for strongly convex optimization
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
• Nearly unbiased variable selection under minimax concave penalty
• Non-asymptotic analysis of hybrid SPG for non-convex stochastic composite optimization
• Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
• On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Orthogonal nonnegative matrix factorization by sparsity and nuclear norm optimization
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator
• Sparsity and Smoothness Via the Fused Lasso
• Strong and Weak Convexity of Sets and Functions
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
• Variable smoothing for convex optimization problems using stochastic gradients
• Variable smoothing for weakly convex composite functions

This page was built for publication: Variable smoothing alternating proximal gradient algorithm for coupled composite optimization

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