Probing the Pareto frontier for basis pursuit solutions
From MaRDI portal
Publication:3558672
Recommendations
- Atomic Decomposition by Basis Pursuit
- On the stability of the basis pursuit in the presence of noise
- Atomic decomposition by basis pursuit
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Cited in
(only showing first 100 items - show all)- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- Numerical integration in multiple dimensions with designed quadrature
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Iterative choice of the optimal regularization parameter in TV image restoration
- Compressive Sensing
- Randomized block proximal damped Newton method for composite self-concordant minimization
- Enabling numerically exact local solver for waveform inversion -- a low-rank approach
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
- Reconstruction of jointly sparse vectors via manifold optimization
- Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
- Two-dimensional random projection
- Sparse polynomial chaos expansions: literature survey and benchmark
- The modified accelerated Bregman method for regularized basis pursuit problem
- Generalization bounds for sparse random feature expansions
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery
- Lattice-based patterned fabric inspection by using total variation with sparsity and low-rank representations
- Gradient projection Newton pursuit for sparsity constrained optimization
- Sparse subsampling of flow measurements for finite-time Lyapunov exponent in domains with obstacles
- Fixed point and Bregman iterative methods for matrix rank minimization
- Optimized Sampling for Multiscale Dynamics
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems
- Sparse approximate solution of partial differential equations
- An improved radial basis function Neuron network based on the \(l_1\) regularization
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Algorithms that satisfy a stopping criterion, probably
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- Sparsity optimization in design of multidimensional filter networks
- Gradient descent and fast artificial time integration
- A cyclic projected gradient method
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Greedy subspace pursuit for joint sparse recovery
- A general theory of singular values with applications to signal denoising
- Infinite-dimensional compressed sensing and function interpolation
- Accelerated linearized Bregman method
- On the representation of functions with Gaussian wave packets
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- A solution method for nonlinear monotone equations via hybrid spectral conjugate gradient and signal recovery problems
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks
- Accelerating Sparse Recovery by Reducing Chatter
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- Cardinality-constrained structured data-fitting problems
- Phase transitions for greedy sparse approximation algorithms
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- A level-set method for convex optimization with a feasible solution path
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
- \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve)
- Generalized Kalman smoothing: modeling and algorithms
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- Stochastic collocation algorithms using \(l_1\)-minimization for Bayesian solution of inverse problems
- Cardinality minimization, constraints, and regularization: a survey
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- A dual active set method for \(\ell1\)-regularized problem
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- An efficient projection algorithm for solving convex constrained monotone operator equations and sparse signal reconstruction problems
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms
- Parallel multipopulation optimization for belief rule base learning
- A perturbation view of level-set methods for convex optimization
- An efficient projection algorithm for large-scale system of monotone nonlinear equations with applications in signal recovery
- Penalty methods for a class of non-Lipschitz optimization problems
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Level set methods for stochastic discontinuity detection in nonlinear problems
- Matrix-free convex optimization modeling
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- The distance between convex sets with Minkowski sum structure: application to collision detection
- Doubly iteratively reweighted algorithm for constrained compressed sensing models
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Nonuniform recovery of fusion frame structured sparse signals
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- Fast projection onto the simplex and the l₁ ball
- New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Alternating direction method of multipliers for solving dictionary learning models
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- A projection method for convex constrained monotone nonlinear equations with applications
- Subspace Newton method for sparse group \(\ell_0\) optimization problem
- Tensor least angle regression for sparse representations of multidimensional signals
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- Sparse solutions of a class of constrained optimization problems
- Matrix-free interior point method for compressed sensing problems
- Numerical analysis for conservation laws using \(l_1\) minimization
This page was built for publication: Probing the Pareto frontier for basis pursuit solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558672)
