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...

Celý popis

Podrobná bibliografia

Vydané v:	Applied numerical mathematics Ročník 195; s. 17 - 38
Hlavní autori:	Yin, Jianghua, Jian, Jinbao, Jiang, Xianzhen, Wu, Jiansheng, Ma, Guodong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.01.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!