Sensitivity analysis of the proximal-based parallel decomposition methods
From MaRDI portal
Publication:1719313
DOI10.1155/2014/891017zbMath1407.90255OpenAlexW2029490716WikidataQ59070401 ScholiaQ59070401MaRDI QIDQ1719313
Zhanke Yu, Feng Ma, Lei Zhu, Ming-Fang Ni
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/891017
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- 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
- 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
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An improved prediction-correction method for monotone variational inequalities with separable operators
- A proximal-based deomposition method for compositions method for convex minimization problems
- A note on the alternating direction method of multipliers
- Alternating proximal gradient method for convex minimization
- An inexact alternating direction method for solving a class of structured variational inequalities
- Proximal Splitting Methods in Signal Processing
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- The Split Bregman Method for L1-Regularized Problems
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
- 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
This page was built for publication: Sensitivity analysis of the proximal-based parallel decomposition methods