English
Related papers

Related papers: A convergence proof of the split Bregman method fo…

200 papers

We develop two new variants of alternating direction methods of multipliers (ADMM) and two parallel primal-dual decomposition algorithms to solve a wide range class of constrained convex optimization problems. Our approach relies on a novel…

Optimization and Control · Mathematics 2018-06-15 Quoc Tran-Dinh , Yuzixuan Zhu

In recent years, several convergent multi-block variants of the alternating direction method of multipliers (ADMM) have been proposed for solving the convex quadratic semidefinite programming via its dual, which is naturally a 3-block…

Optimization and Control · Mathematics 2018-07-06 Xiaokai Chang , Liang Chen , Sanyang Liu

In multiband fusion, an image with a high spatial and low spectral resolution is combined with an image with a low spatial but high spectral resolution to produce a single multiband image having high spatial and spectral resolutions. This…

Image and Video Processing · Electrical Eng. & Systems 2022-10-11 Unni V. S. , Pravin Nair , Kunal N. Chaudhury

The ability of widely distributed radar systems to capture diverse spatial scattering properties substantially improves radar imaging performance. Traditional imaging methods leverage regularized optimization techniques to reconstruct…

Signal Processing · Electrical Eng. & Systems 2023-07-18 Ahmed Murtada , Bhavani Shankar Mysore Rama Rao , Udo Schroeder

Regularisation theory in Banach spaces, and non--norm-squared regularisation even in finite dimensions, generally relies upon Bregman divergences to replace norm convergence. This is comparable to the extension of first-order optimisation…

Optimization and Control · Mathematics 2021-03-19 Tuomo Valkonen

Convex quadratic programs (QPs) constitute a fundamental computational primitive across diverse domains including financial optimization, control systems, and machine learning. The alternating direction method of multipliers (ADMM) has…

Optimization and Control · Mathematics 2025-05-15 Xi Gao , Jinxin Xiong , Linxin Yang , Akang Wang , Weiwei Xu , Jiang Xue

This paper addresses the structurally-constrained sparse decomposition of multi-dimensional signals onto overcomplete families of vectors, called dictionaries. The contribution of the paper is threefold. Firstly, a generic spatio-temporal…

Data Structures and Algorithms · Computer Science 2016-10-03 Yoann Isaac , Quentin Barthélemy , Cédric Gouy-Pailler , Michèle Sebag , Jamal Atif

The alternating direction method of multipliers (ADMM) is a powerful optimization solver in machine learning. Recently, stochastic ADMM has been integrated with variance reduction methods for stochastic gradient, leading to SAG-ADMM and…

Machine Learning · Computer Science 2016-10-18 Shuai Zheng , James T. Kwok

This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output detection, and maximum mean discrepancy calculation et al. The…

Optimization and Control · Mathematics 2025-12-15 Lijun Xie , Ran Gu , Xin Liu

We consider the image denoising problem using total variation (TV) regularization. This problem can be computationally challenging to solve due to the non-differentiability and non-linearity of the regularization term. We propose an…

Optimization and Control · Mathematics 2014-08-26 Zhiwei Qin , Donald Goldfarb , Shiqian Ma

Support vector machines (SVMs) with sparsity-inducing nonconvex penalties have received considerable attentions for the characteristics of automatic classification and variable selection. However, it is quite challenging to solve the…

Machine Learning · Statistics 2018-09-12 Lei Guan , Linbo Qiao , Dongsheng Li , Tao Sun , Keshi Ge , Xicheng Lu

The task of approximating an arbitrary convex function arises in several learning problems such as convex regression, learning with a difference of convex (DC) functions, and learning Bregman or $f$-divergences. In this paper, we develop…

In this paper, we aim to provide a comprehensive analysis on the linear rate convergence of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex composite optimization problems. Under a certain…

Optimization and Control · Mathematics 2015-08-11 Deren Han , Defeng Sun , Liwei Zhang

In this paper, we show that for a class of linearly constrained convex composite optimization problems, an (inexact) symmetric Gauss-Seidel based majorized multi-block proximal alternating direction method of multipliers (ADMM) is…

Optimization and Control · Mathematics 2019-01-29 Liang Chen , Xudong Li , Defeng Sun , Kim-Chuan Toh

Alternating Direction Method of Multipliers (ADMM) has been used successfully in many conventional machine learning applications and is considered to be a useful alternative to Stochastic Gradient Descent (SGD) as a deep learning optimizer.…

Optimization and Control · Mathematics 2021-07-07 Junxiang Wang , Fuxun Yu , Xiang Chen , Liang Zhao

When sum-of-squares (SOS) programs are recast as semidefinite programs (SDPs) using the standard monomial basis, the constraint matrices in the SDP possess a structural property that we call \emph{partial orthogonality}. In this paper, we…

Optimization and Control · Mathematics 2020-01-13 Yang Zheng , Giovanni Fantuzzi , Antonis Papachristodoulou

This paper introduces the Bi-linear consensus Alternating Direction Method of Multipliers (Bi-cADMM), aimed at solving large-scale regularized Sparse Machine Learning (SML) problems defined over a network of computational nodes.…

Machine Learning · Computer Science 2024-06-27 Alireza Olama , Andreas Lundell , Jan Kronqvist , Elham Ahmadi , Eduardo Camponogara

Multiplicative noise models occur in the study of several coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser imaging. This type of noise is also commonly referred to as speckle. Multiplicative…

Optimization and Control · Mathematics 2009-03-25 Jose M. Bioucas-Dias , Mario A. T. Figueiredo

We develop a novel stochastic primal dual splitting method with Bregman distances for solving a structured composite problems involving infimal convolutions in non-Euclidean spaces. The sublinear convergence in expectation of the…

Optimization and Control · Mathematics 2021-03-17 Nguyen Van Dung , Băng Công Vũ

This work proposes a novel convex-non-convex formulation of the image segmentation and the image completion problems. The proposed approach is based on the minimization of a functional involving two distinct regularization terms: one…

Numerical Analysis · Mathematics 2025-09-01 Mohamed El Guide , Anas El Hachimi , Khalide Jbilou , Lothar Reichel