Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization
From MaRDI portal
Publication:827573
DOI10.3934/naco.2020047zbMath1452.90243arXiv1906.12112OpenAlexW3089672647MaRDI QIDQ827573
Publication date: 13 January 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.12112
global convergenceconvex optimizationalternating direction method of multipliersBFGS updatevariable metric indefinite proximal term
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of quasi-Newton type (90C53)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- Gradient methods for minimizing composite functions
- A class of linearized proximal alternating direction methods
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
- 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
- Hedonic housing prices and the demand for clean air
- Sparse spatial autoregressions
- A new inexact alternating directions method for monotone variational inequalities
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Proximal alternating directions method for structured variational inequalities
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
This page was built for publication: Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization