NESTA

swMATH6576MaRDI QIDQ18668FDOQ18668

Author name not available (Why is that?)

Described by source

• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

Cited In (only showing first 100 items - show all)

• On the convergence of a class of inertial dynamical systems with Tikhonov regularization
• Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
• Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
• Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
• Collaborative block compressed sensing reconstruction with dual-domain sparse representation
• Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
• A nonlinear PDE-based method for sparse deconvolution
• Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
• An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems
• A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
• An Efficient Proximity Point Algorithm for Total-Variation-Based Image Restoration
• A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso
• Sparsity Constrained Estimation in Image Processing and Computer Vision
• A modulus-based iterative method for sparse signal recovery
• ADMM in Krylov Subspace and Its Application to Total Variation Restoration of Spatially Variant Blur
• Robust Manhattan non-negative matrix factorization for image recovery and representation
• An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
• Nesterov's algorithm solving dual formulation for compressed sensing
• An accelerated Uzawa method for application to frictionless contact problem
• Alternating direction method of multipliers for solving dictionary learning models
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
• PCM-TV-TFV: A Novel Two-Stage Framework for Image Reconstruction from Fourier Data
• Fast bundle-level methods for unconstrained and ball-constrained convex optimization
• A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
• NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems
• Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
• Topology selection in graphical models of autoregressive processes
• Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
• Sparse Image and Signal Processing
• Sparse group fused Lasso for model segmentation: a hybrid approach
• Sampling in the analysis transform domain
• On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization
• A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
• Generalized Conditional Gradient for Sparse Estimation
• An accelerated version of alternating direction method of multipliers for TV minimization in EIT
• Accelerated augmented Lagrangian method for total variation minimization
• The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
• A relaxed-PPA contraction method for sparse signal recovery
• Proximal Markov chain Monte Carlo algorithms
• MCEN: a method of simultaneous variable selection and clustering for high-dimensional multinomial regression
• Relax-and-split method for nonconvex inverse problems
• Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery
• Iterative regularization via dual diagonal descent
• Block matching video compression based on sparse representation and dictionary learning
• Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step
• An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
• Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
• GMRES-Accelerated ADMM for Quadratic Objectives
• Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
• Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
• A compressed-sensing approach for closed-loop optimal control of nonlinear systems
• Accelerated gradient sliding for structured convex optimization
• Accelerated first-order methods for hyperbolic programming
• A projected gradient method for αℓ ₁ − βℓ ₂ sparsity regularization ^**
• The Moreau envelope based efficient first-order methods for sparse recovery
• WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions
• An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint
• Implicit regularization with strongly convex bias: Stability and acceleration
• Improved Recovery Guarantees and Sampling Strategies for TV Minimization in Compressive Imaging
• Norm sensitivity of sparsity regularization with respect to p
• Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing
• An Introduction to Compressed Sensing
• A simple homotopy proximal mapping algorithm for compressive sensing
• Iterative choice of the optimal regularization parameter in TV image restoration
• A distributed algorithm for fitting generalized additive models
• A second-order method for strongly convex \(\ell _1\)-regularization problems
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• An optimal method for stochastic composite optimization
• A unified primal-dual algorithm framework based on Bregman iteration
• An efficient augmented Lagrangian method with applications to total variation minimization
• Continuous Multiclass Labeling Approaches and Algorithms
• On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
• Sparse Image and Signal Processing
• A significance test for the lasso
• A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
• The geometry of least squares in the 21st century
• Sparse occlusion detection with optical flow
• Discussion: ``A significance test for the lasso
• Sparse channel separation using random probes
• Title not available (Why is that?)
• Accelerated gradient boosting
• A non-adapted sparse approximation of PDEs with stochastic inputs
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
• Analysis and Generalizations of the Linearized Bregman Method
• A Trust-region Method for Nonsmooth Nonconvex Optimization
• Matrix-free interior point method for compressed sensing problems
• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
• Solving Basis Pursuit
• Restoration of images based on subspace optimization accelerating augmented Lagrangian approach
• Proximal methods for the latent group lasso penalty
• Generalized row-action methods for tomographic imaging

This page was built for software: NESTA