A simple and feasible method for a class of large-scale l^1-problems
DOI10.1016/J.CAMWA.2015.06.004zbMATH Open1443.49038OpenAlexW916059374MaRDI QIDQ2006233FDOQ2006233
Authors: Jian-Xun Zhao 
Publication date: 8 October 2020
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2015.06.004
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.
Discrete approximations in optimal control (49M25) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Cites Work
- Nonlinear total variation based noise removal algorithms
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Title not available (Why is that?)
- Two-Point Step Size Gradient Methods
- The Split Bregman Method for L1-Regularized Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Multiplier and gradient methods
- Title not available (Why is that?)
- The multiplier method of Hestenes and Powell applied to convex programming
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Monotone Operators and the Proximal Point Algorithm
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Neighborliness of randomly projected simplices in high dimensions
- A new inexact alternating directions method for monotone variational inequalities
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Removing multiplicative noise by Douglas-Rachford splitting methods
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Title not available (Why is that?)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Identification of Discontinuous Coefficients in Elliptic Problems Using Total Variation Regularization
- Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices
- Quantitative robust uncertainty principles and optimally sparse decompositions
- A descent method for structured monotone variational inequalities
- Wavelets and curvelets for image deconvolution: a combined approach
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- On Effective Methods for Implicit Piecewise Smooth Surface Recovery
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
Cited In (1)
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)
