A generalized Peaceman-Rachford splitting method with indefinite proximal term

MaRDI QIDQ5128178zbMATH OpenFDO

Authors Long Ma, J. W. Peng

Publication date 27 October 2020

zbMATH Keywords

convex optimizationindefinite proximal termPeaceman-Rachford split method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
• Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming
• An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming
• An inertial proximal Peaceman-Rachford splitting method

Cited in

(5)

• Generalized Peaceman-Rachford splitting method with substitution for convex programming
• Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization
• An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming
• A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems
• An inertial proximal Peaceman-Rachford splitting method

This page was built for publication: A generalized Peaceman-Rachford splitting method with indefinite proximal term

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5128178)