Sensitivity analysis of the proximal-based parallel decomposition methods
Summary: The proximal-based parallel decomposition methods were recently proposed to solve structured convex optimization problems. These algorithms are eligible for parallel computation and can be used efficiently for solving large-scale separable problems. In this paper, compared with the previous theoretical results, we show that the range of the involved parameters can be enlarged while the convergence can be still established. Preliminary numerical tests on stable principal component pursuit problem testify to the advantages of the enlargement.
- scientific article; zbMATH DE number 1300072
- Parallel sensitivity analysis for efficient large-scale dynamic optimization
- A parallel computational model for sensitivity analysis in optimization for robustness
- Sensitivity analysis for parameterized variational inequality problems
- scientific article; zbMATH DE number 5257352
- Sensitivity analysis in parametrized convex vector optimization
- Parallel proximal decomposition algorithms for robust estimation.
- A proximal partially parallel splitting method for separable convex programs
- A note on the alternating direction method of multipliers
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Alternating proximal gradient method for convex minimization
- An improved prediction-correction method for monotone variational inequalities with separable operators
- An inexact alternating direction method for solving a class of structured variational inequalities
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 6135093 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Navigating in a graph by aid of its spanning tree metric
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the O(1/t) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- On the linear convergence of the alternating direction method of multipliers
- Proximal splitting methods in signal processing
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The Split Bregman Method for L1-Regularized Problems
This page was built for publication: Sensitivity analysis of the proximal-based parallel decomposition methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1719313)
