Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
Published 2014 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
Authors
Keywords
Convex programs, Alternating direction method, Linearized alternating direction method, Proximal alternating direction method, Parallel splitting, Adaptive renalty
Journal
MACHINE LEARNING
Volume 99, Issue 2, Pages 287-325
Publisher
Springer Nature
Online
2014-11-21
DOI
10.1007/s10994-014-5469-5
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Latent variable graphical model selection via convex optimization
- (2012) Venkat Chandrasekaran et al. ANNALS OF STATISTICS
- Robust Recovery of Subspace Structures by Low-Rank Representation
- (2012) Guangcan Liu et al. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- (2012) Junfeng Yang et al. MATHEMATICS OF COMPUTATION
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- (2012) Bingsheng He et al. SIAM JOURNAL ON NUMERICAL ANALYSIS
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- (2012) Bingsheng He et al. SIAM JOURNAL ON OPTIMIZATION
- Fast Multiple-Splitting Algorithms for Convex Optimization
- (2012) Donald Goldfarb et al. SIAM JOURNAL ON OPTIMIZATION
- Robust principal component analysis?
- (2011) Emmanuel J. Candès et al. JOURNAL OF THE ACM
- A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
- (2010) Xiaoqun Zhang et al. JOURNAL OF SCIENTIFIC COMPUTING
- The group lasso for logistic regression
- (2010) Lukas Meier et al. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY
- A Singular Value Thresholding Algorithm for Matrix Completion
- (2010) Jian-Feng Cai et al. SIAM JOURNAL ON OPTIMIZATION
- Exact Matrix Completion via Convex Optimization
- (2009) Emmanuel J. Candès et al. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
- Robust Face Recognition via Sparse Representation
- (2009) J. Wright et al. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
- Fixed point and Bregman iterative methods for matrix rank minimization
- (2009) Shiqian Ma et al. MATHEMATICAL PROGRAMMING
- The Split Bregman Method for L1-Regularized Problems
- (2009) Tom Goldstein et al. SIAM Journal on Imaging Sciences
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- (2009) Amir Beck et al. SIAM Journal on Imaging Sciences
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started