A θ-inertial ADMM for efficient and stable nonconvex optimization
- 9 February 2026
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 483
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (72071202)
This publication has 45 references indexed in Scilit:
- A Method of Inertial Regularized ADMM for Separable Nonconvex Optimization ProblemsSoft Computing, 2023
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithmsComputational Optimization and Applications, 2020
- Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimizationMathematical Programming, 2019
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problemsComputational Optimization and Applications, 2019
- iPiasco: Inertial Proximal Algorithm for Strongly Convex OptimizationJournal of Mathematical Imaging and Vision, 2015
- Iteration-complexity of first-order augmented Lagrangian methods for convex programmingMathematical Programming, 2015
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergentMathematical Programming, 2014
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- Comments on «Wavelets in statistics: A review» by A. AntoniadisStatistical Methods & Applications, 1997
- Heavy-ball method in nonconvex optimization problemsComputational Mathematics and Modeling, 1993