A proximal block minimization method of multipliers with a substitution procedure
From MaRDI portal
Publication:3458819
DOI10.1080/10556788.2014.992432zbMath1328.90105OpenAlexW2024285170MaRDI QIDQ3458819
No author found.
Publication date: 28 December 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.992432
convex programmingconvergence rateblock coordinate descent methodalternating direction method of multiplierscontraction methods
Related Items (4)
Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure ⋮ Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems ⋮ Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization ⋮ Unnamed Item
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A note on the convergence of alternating proximal gradient method
- A coordinate gradient descent method for nonsmooth separable minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A note on the alternating direction method of multipliers
- An ADM-based splitting method for separable convex programming
- A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Atomic Decomposition by Basis Pursuit
- Numerical Optimization
- On the Convergence of Constrained Parallel Variable Distribution Algorithms
- Equilibrium Pricing of Interference in Cognitive Radio Networks
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- On the Convergence of Block Coordinate Descent Type Methods
This page was built for publication: A proximal block minimization method of multipliers with a substitution procedure
