A proximal parallel splitting method for minimizing sum of convex functions with linear constraints

DOI10.1016/J.CAM.2013.07.010MaRDI QIDQ2348955zbMATH OpenOpenAlexFDO

Authors Deren Han, Hongjin He, Lingling Xu

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

zbMATH Keywords

global convergencelinearized algorithmparallel splitting methodproximal point algorithmseparable structure

Mathematics Subject Classification ID

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

Recommendations

• A proximal partially parallel splitting method for separable convex programs
• A note on augmented Lagrangian-based parallel splitting method
• A splitting method for separable convex programming
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• A parallel splitting method for separable convex programs

Cited in

(17)

• Linearized block-wise alternating direction method of multipliers for multiple-block convex programming
• Approximate methods for convex minimization problems with series-parallel structure
• A contraction method with proximal regularization for linearly constrained convex optimization problem with separable structures
• A proximal block minimization method of multipliers with a substitution procedure
• 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 proximal partially parallel splitting method for separable convex programs
• Splitting proximal with penalization schemes for additive convex hierarchical minimization problems
• scientific article; zbMATH DE number 7652690 (Why is no real title available?)
• 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
• 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
• A proximal alternating direction method of multipliers with a substitution procedure
• A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
• A convex combined symmetric alternating direction method of multipliers for separable optimization

This page was built for publication: A proximal parallel splitting method for minimizing sum of convex functions with linear constraints

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