The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
From MaRDI portal
Publication:504566
DOI10.1186/S13660-017-1295-1zbMATH Open1358.90100OpenAlexW2578978188WikidataQ37587026 ScholiaQ37587026MaRDI QIDQ504566FDOQ504566
Publication date: 17 January 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1295-1
Recommendations
- Convergence study of indefinite proximal ADMM with a relaxation factor
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- Inexact generalized proximal alternating direction methods of multipliers and their convergence rates
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems
compressive sensingproximal alternating direction method of multiplierstwo-block separable convex minimization problem
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Latent variable graphical model selection via convex optimization
- Convex Analysis
- Fast alternating direction optimization methods
- A unified primal-dual algorithm framework based on Bregman iteration
- A new inexact alternating directions method for monotone variational inequalities
- The linearized alternating direction method of multipliers for Dantzig selector
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
- A class of linearized proximal alternating direction methods
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- Title not available (Why is that?)
Cited In (22)
- Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming
- An alternate minimization method beyond positive definite proximal regularization: convergence and complexity
- Inexact generalized proximal alternating direction methods of multipliers and their convergence rates
- Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
- Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter
- A proximal fully parallel splitting method for stable principal component pursuit
- A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit
- Two improved conjugate gradient methods with application in compressive sensing and motion control
- Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming
- The symmetric ADMM with indefinite proximal regularization and its application
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- The conjugate gradient methods for solving the generalized periodic Sylvester matrix equations
- An accelerated proximal augmented Lagrangian method and its application in compressive sensing
- On convergence rates of proximal alternating direction method of multipliers
- A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming
- The proximal augmented Lagrangian method with indefinite proximal regularization and its application in image restoration
- A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem
- Convergence analysis of the relaxed proximal point algorithm
- A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization
- Convergence study of indefinite proximal ADMM with a relaxation factor
Uses Software
This page was built for publication: The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504566)
