A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints

DOI10.1007/s00211-013-0580-2zbMath1295.90046MaRDI QIDQ2450861

Hai Yang, Deren Han, Hongjin He, Xiao-Ming Yuan

Publication date: 23 May 2014

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-013-0580-2

zbMATH Keywords

linear constraints; separable objective function; customized DRSM

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory