Pages that link to "Item:Q1945369"
From MaRDI portal
The following pages link to Error forgetting of Bregman iteration (Q1945369):
Displaying 18 items.
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- A splitting method for orthogonality constrained problems (Q461228) (← links)
- Sparse \(\ell_ {1}\) regularisation of matrix valued models for acoustic source characterisation (Q724334) (← links)
- Inexact accelerated augmented Lagrangian methods (Q887168) (← links)
- Consensus optimization of total variation-based reverse time migration (Q2192815) (← links)
- Localized density matrix minimization and linear-scaling algorithms (Q2375178) (← links)
- Adaptive \(l_1\)-regularization for short-selling control in portfolio selection (Q2419515) (← links)
- An SBV relaxation of the cross-Newell energy for modeling stripe patterns and their defects (Q2676242) (← links)
- On the Convergence of Decentralized Gradient Descent (Q2821798) (← links)
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit (Q3450036) (← links)
- Bregman iterative algorithms for 2D geosounding inversion (Q3466149) (← links)
- Triangulated Surface Denoising using High Order Regularization with Dynamic Weights (Q4646449) (← links)
- A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures (Q4992263) (← links)
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732) (← links)
- Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers (Q5236635) (← links)
- Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)
- An $L^1$ Penalty Method for General Obstacle Problems (Q5264051) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)