Pages that link to "Item:Q3465935"
From MaRDI portal
The following pages link to A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming (Q3465935):
Displayed 14 items.
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems (Q295005) (← links)
- Solving total-variation image super-resolution problems via proximal symmetric alternating direction methods (Q308168) (← links)
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
- Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers (Q2029140) (← links)
- Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix (Q2067888) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems (Q2275326) (← links)
- An LQP-based symmetric alternating direction method of multipliers with larger step sizes (Q2314067) (← links)
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes (Q3179612) (← links)
- The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming (Q4967363) (← links)
- Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size (Q5030635) (← links)
- A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems (Q5031806) (← links)
- Multivariate Monotone Inclusions in Saddle Form (Q5085132) (← links)
- Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (Q5239082) (← links)
