Error forgetting of Bregman iteration
From MaRDI portal
Publication:1945369
DOI10.1007/s10915-012-9616-5zbMath1263.65059OpenAlexW2033779259MaRDI QIDQ1945369
Publication date: 8 April 2013
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/102193
augmented Lagrangian methodpolyhedral functionsparse optimizationBregman iterationmethod of multipliers\(\ell _{1}\) minimizationconvex piece-wise linear functionerror forgetting
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)
Related Items
Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit, Localized density matrix minimization and linear-scaling algorithms, Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere, Bregman iterative algorithms for 2D geosounding inversion, Inexact accelerated augmented Lagrangian methods, An SBV relaxation of the cross-Newell energy for modeling stripe patterns and their defects, Adaptive \(l_1\)-regularization for short-selling control in portfolio selection, Consensus optimization of total variation-based reverse time migration, A splitting method for orthogonality constrained problems, Triangulated Surface Denoising using High Order Regularization with Dynamic Weights, An introduction to continuous optimization for imaging, Sparse \(\ell_ {1}\) regularisation of matrix valued models for acoustic source characterisation, On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming, On the Convergence of Decentralized Gradient Descent, Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers, A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures, Minimization of $\ell_{1-2}$ for Compressed Sensing, An $L^1$ Penalty Method for General Obstacle Problems
Uses Software
Cites Work
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- Nonlinear inverse scale space methods
- Multiplier and gradient methods
- Thevenin decomposition and large-scale optimization
- Analysis and Generalizations of the Linearized Bregman Method
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Exact Regularization of Convex Programs
- Necessary and sufficient conditions for a penalty method to be exact
- Monotone Operators and the Proximal Point Algorithm
- Sparse Reconstruction by Separable Approximation
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Variational, Geometric, and Level Set Methods in Computer Vision
- An Iterative Regularization Method for Total Variation-Based Image Restoration
