Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- 19 July 2022
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 83 (1) , 247-285
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- FP7 Ideas: European Research Council (679515)
- Fonds De La Recherche Scientifique - FNRS (O005318F-RG47)
This publication has 55 references indexed in Scilit:
- Optimization with Sparsity-Inducing PenaltiesFoundations and Trends in Machine Learning, 2012
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Robust principal component analysis?Journal of the ACM, 2011
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic featuresMathematical Programming, 2007
- On the convergence of the block nonlinear Gauss–Seidel method under convex constraintsOperations Research Letters, 2000
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976
- A quadratic programming procedureNaval Research Logistics Quarterly, 1957