An implementable first-order primal-dual algorithm for structured convex optimization
From MaRDI portal
Publication:1724030
DOI10.1155/2014/396753zbMath1470.90083OpenAlexW1993665416WikidataQ59037316 ScholiaQ59037316MaRDI QIDQ1724030
Lei Zhu, Feng Ma, Zhanke Yu, Ming-Fang Ni
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/396753
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the linear convergence of the alternating direction method of multipliers
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A note on the alternating direction method of multipliers
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Alternating proximal gradient method for convex minimization
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A customized proximal point algorithm for convex minimization with linear constraints
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Robust principal component analysis?
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- The Split Bregman Method for L1-Regularized Problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Positive-Definite ℓ1-Penalized Estimation of Large Covariance Matrices
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
