Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning

DOI10.1007/s10994-014-5469-5zbMath1331.68189arXiv1310.5035OpenAlexW2071631699MaRDI QIDQ2353007

Zhouchen Lin, Risheng Liu, Hu-An Li

Publication date: 7 July 2015

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5035

zbMATH Keywords

convex programsalternating direction methodparallel splittingproximal alternating direction methodadaptive renaltylinearized alternating direction method

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

The symmetric ADMM with indefinite proximal regularization and its application ⋮ Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter ⋮ A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems ⋮ Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers ⋮ Unnamed Item ⋮ Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor ⋮ An accelerated proximal augmented Lagrangian method and its application in compressive sensing ⋮ Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems ⋮ Weighted nuclear norm minimization and its applications to low level vision ⋮ An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit ⋮ The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization ⋮ Estimation of the parameters of a weighted nuclear norm model and its application in image denoising ⋮ Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming ⋮ ADMM for multiaffine constrained optimization ⋮ Optimally linearizing the alternating direction method of multipliers for convex programming ⋮ Dual robust regression for pattern classification ⋮ Tensorized multi-view subspace representation learning ⋮ Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis ⋮ Tensor Q-rank: new data dependent definition of tensor rank ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ An alternate minimization method beyond positive definite proximal regularization: convergence and complexity ⋮ A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm ⋮ Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction

Uses Software

• Yall1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Latent variable graphical model selection via convex optimization
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Fixed point and Bregman iterative methods for matrix rank minimization
• A unified primal-dual algorithm framework based on Bregman iteration
• An alternating direction algorithm for matrix completion with nonnegative factors
• Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Exact matrix completion via convex optimization
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Fast Multiple-Splitting Algorithms for Convex Optimization
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• The Split Bregman Method for L1-Regularized Problems
• The Group Lasso for Logistic Regression
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Convex Analysis
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent