A proximal fully parallel splitting method with a relaxation factor for separable convex programming

In this paper, we propose a proximal fully parallel splitting method with a relaxation factor for solving separable convex minimization model with linear constraints, where the objective function is the sum of m individual functions without coupled variables. With a full Jacobian decomposition, we d...

Full description

Bibliographic Details

Published in:	Applied numerical mathematics Vol. 195; pp. 17 - 38
Main Authors:	Yin, Jianghua, Jian, Jinbao, Jiang, Xianzhen, Wu, Jiansheng, Ma, Guodong
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2024
Subjects:	Augmented Lagrangian method Convergence rate Relaxation factor Splitting algorithm Step size Step size Splitting algorithm Convergence rate Augmented Lagrangian method Relaxation factor
ISSN:	0168-9274
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!