A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
DOI10.1016/j.amc.2021.126425OpenAlexW3175936473MaRDI QIDQ2245040
Publication date: 12 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.05544
global convergencenonconvex optimization problemsfeasibility problemlow rank matrix completionparameterized Douglas-Rachford splitting methodsparsity constrained least squares problem
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Matrix completion problems (15A83)
Related Items (1)
Cites Work
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- A new projection method for finding the closest point in the intersection of convex sets
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A parameterized Douglas-Rachford algorithm
- Exact matrix completion via convex optimization
- Linear convergence of the Douglas–Rachford method for two closed sets
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- On Projection Algorithms for Solving Convex Feasibility Problems
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators
- Regularization and Variable Selection Via the Elastic Net
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Sparse Approximation via Penalty Decomposition Methods
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
