Pages that link to "Item:Q1687318"
From MaRDI portal
The following pages link to Peaceman-Rachford splitting for a class of nonconvex optimization problems (Q1687318):
Displaying 28 items.
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
- Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm (Q1675933) (← links)
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming (Q1787117) (← links)
- General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems (Q2141356) (← links)
- Generalized Peaceman-Rachford splitting method with substitution for convex programming (Q2228367) (← links)
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization (Q2245040) (← links)
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems (Q2275326) (← links)
- A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems (Q2333721) (← links)
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA (Q2363673) (← links)
- An envelope for Davis-Yin splitting and strict saddle-point avoidance (Q2420798) (← links)
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano (Q4624932) (← links)
- A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization (Q5005209) (← links)
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs (Q5017510) (← links)
- A splitting method for finding the resolvent of the sum of two maximal monotone operators (Q5090286) (← links)
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems (Q5110327) (← links)
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results (Q5210517) (← links)
- Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (Q5239082) (← links)
- Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming (Q5275290) (← links)
- Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation (Q6038829) (← links)
- Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems (Q6099473) (← links)
- A parameterized three-operator splitting algorithm for non-convex minimization problems with applications (Q6561488) (← links)
- An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in \(\ell_{1 / 2}\) regularized compressed sensing problems (Q6591534) (← links)
- A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness (Q6644234) (← links)
