A simple and feasible method for a class of large-scale l^1-problems
From MaRDI portal
Publication:2006233
Recommendations
- An alternating direction method of multipliers for optimal control problems constrained with elliptic equations
- An alternating direction method of multipliers for elliptic equation constrained optimization problem
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with L^1-control cost
- An inexact alternating direction method for solving a class of monotone variational inequalities
- A two-phase strategy for control constrained elliptic optimal control problems.
Cites work
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- A descent method for structured monotone variational inequalities
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Compressed sensing
- Elliptic optimal control problems with L^1-control cost and applications for the placement of control devices
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1943005 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Identification of Discontinuous Coefficients in Elliptic Problems Using Total Variation Regularization
- Monotone Operators and the Proximal Point Algorithm
- Multiplier and gradient methods
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Neighborliness of randomly projected simplices in high dimensions
- Nonlinear total variation based noise removal algorithms
- On Effective Methods for Implicit Piecewise Smooth Surface Recovery
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Removing multiplicative noise by Douglas-Rachford splitting methods
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- The multiplier method of Hestenes and Powell applied to convex programming
- The Split Bregman Method for L1-Regularized Problems
- Two-Point Step Size Gradient Methods
- Wavelets and curvelets for image deconvolution: a combined approach
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
This page was built for publication: A simple and feasible method for a class of large-scale \(l^1\)-problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006233)
