A parameterized Douglas–Rachford splitting algorithm for nonconvex optimization
- 1 December 2021
- journal article
- research article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 410
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (11771288, 2017YFB0202902)
- National Key Research and Development Program of China (11771288, 2017YFB0202902)
This publication has 23 references indexed in Scilit:
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Tensor completion and low-n-rank tensor recovery via convex optimizationInverse Problems, 2011
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Regularization and Variable Selection Via the Elastic NetJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- On the convergence of von Neumann's alternating projection algorithm for two setsSet-Valued Analysis, 1993
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- Splitting Algorithms for the Sum of Two Nonlinear OperatorsSIAM Journal on Numerical Analysis, 1979
- On the numerical solution of heat conduction problems in two and three space variablesTransactions of the American Mathematical Society, 1956