Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
type: Item
instance of: scholarly article
title: Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
zbMATH Open document ID: 1401.90163
author: M. Sun
author: Hongchun Sun
published in: Journal of Applied Mathematics and Computing
publication date: 2018-09-25T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6943479
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: multi-block separable convex programming
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: s12190-017-1138-8
OpenAlex ID: W2766024743
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Latent variable graphical model selection via convex optimization
cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
cites work: A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence
cites work: The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
cites work: Hankel matrix rank minimization with applications to system identification and realization
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
cites work: Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
cites work: Two-step fixed-point proximity algorithms for multi-block separable convex problems
cites work: A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
cites work: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Split-Bregman iteration for framelet based image inpainting
cites work: Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
cites work: Alternating proximal gradient method for convex minimization
cites work: A proximal Peaceman-Rachford splitting method for compressive sensing
cites work: Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
cites work: Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
cites work: A class of linearized proximal alternating direction methods
cites work: A unified primal-dual algorithm framework based on Bregman iteration
DOI: 10.1007/S12190-017-1138-8
description: scientific article; zbMATH DE number 6943479