Sign Up to like & get
recommendations!
1
Published in 2018 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-018-9996-z
Abstract: This paper considers the relaxed Peaceman–Rachford (PR) splitting method for finding an approximate solution of a monotone inclusion whose underlying operator consists of the sum of two maximal strongly monotone operators. Using general results obtained…
read more here.
Keywords:
splitting method;
relaxed peaceman;
peaceman rachford;
monotone ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2023 at "IEEE Access"
DOI: 10.1109/access.2023.3262414
Abstract: In this paper, we propose a multi-step inertial proximal Peaceman-Rachford splitting method (abbreviated as MIP-PRSM) for solving the two-block separable convex optimization problems with linear constraints, which is a unified framework for such Peaceman-Rachford splitting…
read more here.
Keywords:
method;
step;
rachford splitting;
peaceman rachford ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2020 at "IEEE Control Systems Letters"
DOI: 10.1109/lcsys.2019.2922669
Abstract: Douglas–Rachford splitting and its equivalent dual formulation ADMM are widely used iterative methods in composite optimization problems arising in control and machine learning applications. The performance of these algorithms depends on the choice of step…
read more here.
Keywords:
tex math;
parameter selection;
analysis parameter;
inline formula ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "Symmetry"
DOI: 10.3390/sym14030537
Abstract: The aim of this article is to introduce the Douglas–Rachford splitting method with linearization to solve the split feasibility problem (SFP). Our proposed method includes two existing methods in work of Tang et al. and…
read more here.
Keywords:
split feasibility;
method linearization;
feasibility problem;
splitting method ... See more keywords