PDCO

swMATH5148MaRDI QIDQ17288

No author found.

Related Items (only showing first 100 items - show all)

Combining a relaxed EM algorithm with Occam's razor for Bayesian variable selection in high-dimensional regression ⋮ Computing and analyzing recoverable supports for sparse reconstruction ⋮ 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 ⋮ Regularity properties for sparse regression ⋮ Best subset selection via a modern optimization lens ⋮ Data-driven atomic decomposition via frequency extraction of intrinsic mode functions ⋮ Inducing wavelets into random fields via generative boosting ⋮ Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size ⋮ Statistical consistency of coefficient-based conditional quantile regression ⋮ Forecasting using a large number of predictors: is Bayesian shrinkage a valid alternative to principal components? ⋮ Phase retrieval from Gabor measurements ⋮ Nonlinear residual minimization by iteratively reweighted least squares ⋮ A proximal method for composite minimization ⋮ Projection algorithms for nonconvex minimization with application to sparse principal component analysis ⋮ A dual method for minimizing a nonsmooth objective over one smooth inequality constraint ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Image denoising by generalized total variation regularization and least squares fidelity ⋮ Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods ⋮ Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies ⋮ Gradient methods for minimizing composite functions ⋮ 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 ⋮ Oracle inequalities for the lasso in the Cox model ⋮ Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization ⋮ ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals ⋮ On constrained and regularized high-dimensional regression ⋮ On exact recovery of sparse vectors from linear measurements ⋮ Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions ⋮ Feature selection when there are many influential features ⋮ Remote sensing via \(\ell_1\)-minimization ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Robust visual tracking with structured sparse representation appearance model ⋮ Model-based multiple rigid object detection and registration in unstructured range data ⋮ Restricted isometries for partial random circulant matrices ⋮ Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis ⋮ Sparse conjugate directions pursuit with application to fixed-size kernel models ⋮ Sparse canonical correlation analysis ⋮ Sparse Legendre expansions via \(\ell_1\)-minimization ⋮ On the representation of functions with Gaussian wave packets ⋮ Group coordinate descent algorithms for nonconvex penalized regression ⋮ Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ Matrix-free interior point method ⋮ Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data ⋮ \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve) ⋮ Exact reconstruction using Beurling minimal extrapolation ⋮ Convex feasibility modeling and projection methods for sparse signal recovery ⋮ Degrees of freedom in lasso problems ⋮ UPS delivers optimal phase diagram in high-dimensional variable selection ⋮ Lagrangian-penalization algorithm for constrained optimization and variational inequalities ⋮ Proximal methods for the latent group lasso penalty ⋮ Discussion: Time-threshold maps: using information from wavelet reconstructions with all threshold values simultaneously ⋮ Rejoinder: Time-threshold maps: using information from wavelet reconstructions with all threshold values simultaneously ⋮ 2DPCA with L1-norm for simultaneously robust and sparse modelling ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints ⋮ Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming ⋮ First-order optimality condition of basis pursuit denoise problem ⋮ Robust face recognition via block sparse Bayesian learning ⋮ Sparse time-frequency representation of nonlinear and nonstationary data ⋮ A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization ⋮ A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares ⋮ Sparse dual frames and dual Gabor functions of minimal time and frequency supports ⋮ On higher order isotropy conditions and lower bounds for sparse quadratic forms ⋮ High-dimensional inference in misspecified linear models ⋮ A Barzilai-Borwein type method for minimizing composite functions ⋮ Compressive sensing using chaotic sequence based on Chebyshev map ⋮ Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging ⋮ Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing ⋮ Bayesian signal detection with compressed measurements ⋮ On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery ⋮ A modified greedy analysis pursuit algorithm for the cosparse analysis model ⋮ Sparse decomposition by iterating Lipschitzian-type mappings ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Image reconstruction using analysis model prior ⋮ Compressed sensing from a harmonic analysis point of view ⋮ Data based identification and prediction of nonlinear and complex dynamical systems ⋮ A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization ⋮ Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms ⋮ Two-dimensional random projection ⋮ Node harvest ⋮ A non-adapted sparse approximation of PDEs with stochastic inputs ⋮ Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) ⋮ Compressive wave computation ⋮ Regularized vector field learning with sparse approximation for mismatch removal ⋮ Evolution strategies based adaptive \(L_{p}\) LS-SVM ⋮ Estimation of (near) low-rank matrices with noise and high-dimensional scaling ⋮ Stochastic expansions using continuous dictionaries: Lévy adaptive regression kernels ⋮ Estimator selection in the Gaussian setting ⋮ A unified approach to model selection and sparse recovery using regularized least squares ⋮ A modified local quadratic approximation algorithm for penalized optimization problems ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations ⋮ Nomonotone spectral gradient method for sparse recovery ⋮ Strong convergence of a modified proximal algorithm for solving the lasso

This page was built for software: PDCO