A simple and feasible method for a class of large-scale \(l^1\)-problems
type: Item
instance of: scholarly article
title: A simple and feasible method for a class of large-scale \(l^1\)-problems
zbMATH Open document ID: 1443.49038
publication date: 2020-10-08T00:00:00Z
Mathematics Subject Classification ID: 49M25
Mathematics Subject Classification ID: 65N06
Mathematics Subject Classification ID: 65N22
zbMATH DE Number: 7258337
zbMATH Keywords: elliptic optimal control problem
zbMATH Keywords: alternating direction method
zbMATH Keywords: global convergence
zbMATH Keywords: large-scale problems
author: Jian-Xun Zhao
MaRDI profile type: Publication
full work available at URL: j.camwa.2015.06.004
OpenAlex ID: W916059374
cites work: Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices
cites work: On Effective Methods for Implicit Piecewise Smooth Surface Recovery
cites work: Identification of Discontinuous Coefficients in Elliptic Problems Using Total Variation Regularization
cites work: Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
cites work: Nonlinear total variation based noise removal algorithms
cites work: Compressed sensing
cites work: Neighborliness of randomly projected simplices in high dimensions
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Quantitative robust uncertainty principles and optimally sparse decompositions
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: Q4409540
cites work: Why Simple Shrinkage Is Still Relevant for Redundant Representations?
cites work: Wavelets and curvelets for image deconvolution: a combined approach
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Two-Point Step Size Gradient Methods
cites work: A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
cites work: Q4144736
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Multiplier and gradient methods
cites work: Q5590418
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: A new inexact alternating directions method for monotone variational inequalities
cites work: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
cites work: Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
cites work: A descent method for structured monotone variational inequalities
cites work: Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
cites work: Removing multiplicative noise by Douglas-Rachford splitting methods
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: Monotone Operators and the Proximal Point Algorithm
DOI: 10.1016/J.CAMWA.2015.06.004
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 7258337