Precondition techniques for accelerated linearized Bregman algorithms

MaRDI QIDQ3451275zbMATH OpenFDO

Authors Tao Sun, Hui Zhang, Li-zhi Cheng

Publication date 13 November 2015

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol11/p527.html

zbMATH Keywords

Cholesky decompositionLagrange dual theorylinearized Bregman iterationoptimizationpreconditionsingular value decomposition

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Recommendations

• Accelerated linearized Bregman method
• Analysis and generalizations of the linearized Bregman method
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
• Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
• Linearized Bregman iterations for compressed sensing

Cited in

(4)

• Preconditioned ADMM for a class of bilinear programming problems
• Accelerated linearized Bregman method
• Numerical aspects of the nonstationary modified linearized Bregman algorithm
• Convergence rates of accelerated proximal gradient algorithms under independent noise

This page was built for publication: Precondition techniques for accelerated linearized Bregman algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451275)