swMATH5148MaRDI QIDQ17288FDOQ17288
Author name not available (Why is that?)
Official website: http://web.stanford.edu/group/SOL/software/pdco/
Cited In (only showing first 100 items - show all)
- Compressive Sensing
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- A bilinear algorithm for sparse representations
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Sparsity regularization in inverse problems
- Embedded feature-selection support vector machine for driving pattern recognition
- Simultaneous image fusion and demosaicing via compressive sensing
- Optimal sampling points in reproducing kernel Hilbert spaces
- New properties of forward-backward splitting and a practical proximal-descent algorithm
- Flexible sparse regularization
- Ways to sparse representation: An overview
- Regularity properties for sparse regression
- Data-driven atomic decomposition via frequency extraction of intrinsic mode functions
- Inducing wavelets into random fields via generative boosting
- Projection onto a polyhedron that exploits sparsity
- On constrained and regularized high-dimensional regression
- On higher order isotropy conditions and lower bounds for sparse quadratic forms
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
- Statistical consistency of coefficient-based conditional quantile regression
- Near-ideal model selection by \(\ell _{1}\) minimization
- Learning active basis models by EM-type algorithms
- Exact reconstruction using Beurling minimal extrapolation
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Nonlinear residual minimization by iteratively reweighted least squares
- Phase retrieval from Gabor measurements
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- Matrix-free interior point method
- Two are better than one: fundamental parameters of frame coherence
- Matrix-free interior point method for compressed sensing problems
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- MultiDimensional Sparse Super-Resolution
- Exact support recovery for sparse spikes deconvolution
- SPADES and mixture models
- Compressed sensing from a harmonic analysis point of view
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- A primal-dual regularized interior-point method for convex quadratic programs
- Learning sparse FRAME models for natural image patterns
- Restricted isometries for partial random circulant matrices
- Microlocal analysis of the geometric separation problem
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- Compressed sensing and matrix completion with constant proportion of corruptions
- Image denoising by generalized total variation regularization and least squares fidelity
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Concave programming for minimizing the zero-norm over polyhedral sets
- Evolution strategies based adaptive \(L_{p}\) LS-SVM
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
- Multi-frame representations in linear inverse problems with mixed multi-constraints
- Random sampling of sparse trigonometric polynomials
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Rejoinder: ``A significance test for the lasso
- Data-driven time-frequency analysis
- On the conditioning of random subdictionaries
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- Support recovery for sparse super-resolution of positive measures
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Weaker regularity conditions and sparse recovery in high-dimensional regression
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Bayesian signal detection with compressed measurements
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Compressive wave computation
- A survey of compressed sensing
- Weakly-supervised cross-domain dictionary learning for visual recognition
- Convergence study on the symmetric version of ADMM with larger step sizes
- K-hyperline clustering learning for sparse component analysis
- Support vector machines with adaptive \(L_q\) penalty
- A new nonlinear sparse component analysis for a biologically plausible model of neurons
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- The geometry of off-the-grid compressed sensing
- Robust detection of neural spikes using sparse coding based features
- Atomic decomposition by basis pursuit
- The essential ability of sparse reconstruction of different compressive sensing strategies
- Sparse microwave imaging: principles and applications
- Spectral intrinsic decomposition method for adaptive signal representation
- Learning with tensors: a framework based on convex optimization and spectral regularization
- A multi-resolution, non-parametric, Bayesian framework for identification of spatially-varying model parameters
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Sparsity preserving projections with applications to face recognition
- Forest Garrote
- Discussion: ``A significance test for the lasso
- Traditional and recent approaches in background modeling for foreground detection: an overview
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Support union recovery in high-dimensional multivariate regression
- Homogeneous penalizers and constraints in convex image restoration
- Maximin effects in inhomogeneous large-scale data
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Compressive sensing for subsurface imaging using ground penetrating radar
- Landmark recognition with sparse representation classification and extreme learning machine
- A new computational method for the sparsest solutions to systems of linear equations
This page was built for software: PDCO
