NESTA
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Accelerated gradient boosting
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- A non-adapted sparse approximation of PDEs with stochastic inputs
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Discussion: ``A significance test for the lasso
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Matrix-free interior point method for compressed sensing problems
- 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
- An optimal method for stochastic composite optimization
- Sparse occlusion detection with optical flow
- A unified primal-dual algorithm framework based on Bregman iteration
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Restoring Poissonian images by a combined first-order and second-order variation approach
- Continuous multiclass labeling approaches and algorithms
- Solvability of monotone tensor complementarity problems
- Reweighted minimization model for MR image reconstruction with split Bregman method
- Sparse microwave imaging: principles and applications
- TIGRA
- OSCAR
- PROPACK
- QPA
- RestoreTools
- PDCO
- SNLSDP
- AIRY
- NPtool
- Sparco
- UNLocBoX
- An efficient augmented Lagrangian method with applications to total variation minimization
- ParNes
- CoSaMP
- SPGL1
- TVAL3
- CurveLab
- SparseLab
- COBRA
- Yall1
- na28
- FPC_AS
- FTVd
- ForWaRD
- RecPF
- flare
- L1-MAGIC
- GADMM
- APPLE
- TFOCS
- EdgeCS
- camel
- l1_ls
- Structured sparsity through convex optimization
- A significance test for the lasso
- covTest
- FPC
- L1TestPack
- picasso
- PNOPT
- SpaRSA
- TwIST
- C-HiLasso
- CHIME
- NormalBetaPrime
- LPCCbnc
- Optimal-SPCA
- Iterative choice of the optimal regularization parameter in TV image restoration
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- Analysis and generalizations of the linearized Bregman method
- Inexact and accelerated proximal point algorithms
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- Fast alternating direction optimization methods
- Templates for convex cone problems with applications to sparse signal recovery
- A first-order smoothed penalty method for compressed sensing
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- A first-order augmented Lagrangian method for compressed sensing
- The solution path of the generalized lasso
- Implementation of an optimal first-order method for strongly convex total variation regularization
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- Rejoinder: ``A significance test for the lasso
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- The geometry of least squares in the 21st century
- An accelerated proximal gradient algorithm for frame-based image restoration via the balanced approach
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- A modulus-based iterative method for sparse signal recovery
- An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems
- Collaborative block compressed sensing reconstruction with dual-domain sparse representation
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- An accelerated linearized alternating direction method of multipliers
This page was built for software: NESTA
