NESTA

swMATH6576MaRDI QIDQ18668FDOQ18668

Author name not available (Why is that?)

Official website: http://epubs.siam.org/doi/pdf/10.1137/090756855

Described by source

• NESTA: A fast and accurate first-order method for sparse recovery

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

• Distributed optimization and statistical learning via the alternating direction method of multipliers
• 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
• 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
• Analysis and generalizations of the linearized Bregman method
• On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
• A significance test for the lasso
• The geometry of least squares in the 21st century
• Sparse occlusion detection with optical flow
• Fast alternating direction optimization methods
• Discussion: ``A significance test for the lasso
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• A first-order smoothed penalty method for compressed sensing
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• 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
• An accelerated proximal gradient algorithm for frame-based image restoration via the balanced approach
• Sparse image and signal processing. Wavelets, curvelets, morphological diversity
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
• 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
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
• TIGRA
• RestoreTools
• PDCO
• SNLSDP
• AIRY
• NPtool
• Sparco
• UNLocBoX
• ParNes
• CoSaMP
• SPGL1
• TVAL3
• CurveLab
• SparseLab
• COBRA
• Yall1
• na28
• FPC_AS
• FTVd
• ForWaRD
• RecPF
• flare
• L1-MAGIC
• GADMM
• APPLE
• TFOCS
• EdgeCS
• camel
• l1_ls
• covTest
• FPC
• L1TestPack
• picasso
• PNOPT
• SpaRSA
• TwIST
• C-HiLasso
• CHIME
• NormalBetaPrime
• LPCCbnc
• Optimal-SPCA
• Rejoinder: ``A significance test for the lasso
• Implementation of an optimal first-order method for strongly convex total variation regularization
• Inexact and accelerated proximal point algorithms
• Restoring Poissonian images by a combined first-order and second-order variation approach
• Reweighted minimization model for MR image reconstruction with split Bregman method
• Sparse microwave imaging: principles and applications
• The solution path of the generalized lasso
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
• Discussion: ``A significance test for the lasso
• Continuous multiclass labeling approaches and algorithms
• Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
• Structured sparsity through convex optimization
• Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
• Templates for convex cone problems with applications to sparse signal recovery
• A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
• Solvability of monotone tensor complementarity problems
• IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
• A first-order augmented Lagrangian method for compressed sensing
• On the convergence of a class of inertial dynamical systems with Tikhonov regularization
• Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
• Collaborative block compressed sensing reconstruction with dual-domain sparse representation
• 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
• A nonlinear PDE-based method for sparse deconvolution
• 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

This page was built for software: NESTA