A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
From MaRDI portal
Publication:2348955
DOI10.1016/j.cam.2013.07.010zbMath1314.90060OpenAlexW2090503760MaRDI QIDQ2348955
Hongjin He, Lingling Xu, Deren Han
Publication date: 16 June 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.07.010
global convergenceproximal point algorithmseparable structureparallel splitting methodlinearized algorithm
Related Items (10)
A proximal block minimization method of multipliers with a substitution procedure ⋮ Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ Linearized block-wise alternating direction method of multipliers for multiple-block convex programming ⋮ On the convergence rate of the augmented Lagrangian-based parallel splitting method ⋮ A new alternating direction method for linearly constrained nonconvex optimization problems ⋮ A note on augmented Lagrangian-based parallel splitting method ⋮ A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ A proximal partially parallel splitting method for separable convex programs
This page was built for publication: A proximal parallel splitting method for minimizing sum of convex functions with linear constraints