Sparse Reconstruction by Separable Approximation
From MaRDI portal
(Redirected from Publication:4569734)
Sparse Reconstruction by Separable Approximation (scientific article; zbMATH DE number 6899830)
Sparse Reconstruction by Separable Approximation (scientific article; zbMATH DE number 6899830)
Cited in
(only showing first 100 items - show all)- Multilevel preconditioning and adaptive sparse solution of inverse problems
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Inexact accelerated augmented Lagrangian methods
- scientific article; zbMATH DE number 6860781 (Why is no real title available?)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
- Overlapping patch-based joint-sparse regression for hyperspectral image unmixing
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- Nomonotone spectral gradient method for sparse recovery
- Randomized block proximal damped Newton method for composite self-concordant minimization
- scientific article; zbMATH DE number 5853153 (Why is no real title available?)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- Exactly Uncorrelated Sparse Principal Component Analysis
- Proximal gradient \(\mathcal{VU}\)-method with superlinear convergence for nonsmooth convex optimization
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Spatio-temporal random fields: compressible representation and distributed estimation
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- Hybrid Projection Methods with Recycling for Inverse Problems
- 3D reconstruction for partial data electrical impedance tomography using a sparsity prior
- A proximal method for composite minimization
- Inexact coordinate descent: complexity and preconditioning
- Monocular extraction of 2.1D sketch using constrained convex optimization
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Globally sparse and locally dense signal recovery for compressed sensing
- Sparse regularized fuzzy regression
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- On the forward-backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems
- A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions
- scientific article; zbMATH DE number 7626763 (Why is no real title available?)
- Learning an adaptive dictionary using a projected gradient method and its application on image de-noising
- SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Fast sparse reconstruction: Greedy inverse scale space flows
- Sparse representations and approximation theory
- Augmented flexible Krylov subspace methods with applications to Bayesian inverse problems
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- A new generalized shrinkage conjugate gradient method for sparse recovery
- Proximal gradient methods beyond monotony
- Optimal transportation for electrical impedance tomography
- Computing and analyzing recoverable supports for sparse reconstruction
- A reweighted symmetric smoothed function approximating L₀-norm regularized sparse reconstruction method
- An inexact q-order regularized proximal Newton method for nonconvex composite optimization
- Inexact successive quadratic approximation for regularized optimization
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Shearlet-based regularized reconstruction in region-of-interest computed tomography
- Accelerating block coordinate descent methods with identification strategies
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- An improved fast iterative shrinkage thresholding algorithm for image deblurring
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- Operator inference for non-intrusive model reduction with quadratic manifolds
- An easily implementable algorithm for efficient projection onto the ordered weighted \(\ell_1\) norm ball
- scientific article; zbMATH DE number 7255066 (Why is no real title available?)
- On the rate of convergence of projected Barzilai-Borwein methods
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- Generalized conjugate gradient methods for _1 regularized convex quadratic programming with finite convergence
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- A proximal difference-of-convex algorithm with extrapolation
- Projection onto a polyhedron that exploits sparsity
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Mathematical algorithm design for deep learning under societal and judicial constraints: the algorithmic transparency requirement
- First- and second-order necessary conditions via exact penalty functions
- Sparse reconstructions of acoustic source for inverse scattering problems in measure space
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Fast gradient algorithm with dry-like friction and nonmonotone line search for nonconvex optimization problems
- Cardinality minimization, constraints, and regularization: a survey
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- A truncated Newton algorithm for nonconvex sparse recovery
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- Optimization methods for large-scale machine learning
- On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- A new spectral method for \(l_1\)-regularized minimization
- A global sparse gradient based coupled system for image denoising
- Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- Projection subspace based low-rank representation for sparse hyperspectral unmixing
- A nonmonotone alternating updating method for a class of matrix factorization problems
- On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems
- Iteratively reweighted FGMRES and FLSQR for sparse reconstruction
- Signal approximations based on nonlinear and optimal piecewise affine functions
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Image deblurring by sparsity constraint on the Fourier coefficients
- Adaptive Control and Signal Processing: literature survey (No. 14)
This page was built for publication: Sparse Reconstruction by Separable Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569734)