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

From MaRDI portal
Publication:2353007

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




Related Items

The symmetric ADMM with indefinite proximal regularization and its applicationLinearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameterA new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problemsPartial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of MultipliersUnnamed ItemConvergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factorAn accelerated proximal augmented Lagrangian method and its application in compressive sensingConvergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problemsWeighted nuclear norm minimization and its applications to low level visionAn extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regressionThe Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and RatesTwo proximal splitting methods for multi-block separable programming with applications to stable principal component pursuitThe convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularizationEstimation of the parameters of a weighted nuclear norm model and its application in image denoisingImproved proximal ADMM with partially parallel splitting for multi-block separable convex programmingADMM for multiaffine constrained optimizationOptimally linearizing the alternating direction method of multipliers for convex programmingDual robust regression for pattern classificationTensorized multi-view subspace representation learningAccelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysisTensor Q-rank: new data dependent definition of tensor rankADMM-type methods for generalized multi-facility Weber problemAn alternate minimization method beyond positive definite proximal regularization: convergence and complexityA unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithmAlternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction


Uses Software


Cites Work