SPGL1
From MaRDI portal
Software:20374
No author found.
Source code repository: https://github.com/vegarant/spgl1
Related Items (only showing first 100 items - show all)
Algorithms that satisfy a stopping criterion, probably ⋮ Efficient projection algorithms onto the weighted \(\ell_1\) ball ⋮ Parallel multipopulation optimization for belief rule base learning ⋮ Regularization proximal method for monotone variational inclusions ⋮ Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Fast projection onto the simplex and the \(l_1\) ball ⋮ 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 ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Note on the modified relaxation CQ algorithm for the split feasibility problem ⋮ Quantifying initial and wind forcing uncertainties in the gulf of Mexico ⋮ Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies ⋮ Sparse microwave imaging: principles and applications ⋮ A regularized semi-smooth Newton method with projection steps for composite convex programs ⋮ Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization ⋮ Source localization using a sparse representation framework to achieve superresolution ⋮ Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing ⋮ ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals ⋮ Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere ⋮ A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising ⋮ A note on the spectral gradient projection method for nonlinear monotone equations with applications ⋮ Generalized Kalman smoothing: modeling and algorithms ⋮ The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector ⋮ A polynomial chaos framework for probabilistic predictions of storm surge events ⋮ Dualization of signal recovery problems ⋮ Optimal dual certificates for noise robustness bounds in compressive sensing ⋮ A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball ⋮ Sampling in the analysis transform domain ⋮ On the representation of functions with Gaussian wave packets ⋮ Phase transitions for greedy sparse approximation algorithms ⋮ Accelerated linearized Bregman method ⋮ A cyclic projected gradient method ⋮ Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing ⋮ \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve) ⋮ Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery ⋮ Alternating direction method of multipliers for sparse principal component analysis ⋮ Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm ⋮ An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints ⋮ Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing ⋮ Level set methods for stochastic discontinuity detection in nonlinear problems ⋮ First-order optimality condition of basis pursuit denoise problem ⋮ Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids ⋮ Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence ⋮ Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing ⋮ Learning circulant sensing kernels ⋮ A perturbation view of level-set methods for convex optimization ⋮ Greedy subspace pursuit for joint sparse recovery ⋮ Level-set methods for convex optimization ⋮ Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery ⋮ A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems ⋮ An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ A compressed-sensing approach for closed-loop optimal control of nonlinear systems ⋮ A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation ⋮ Homogeneous penalizers and constraints in convex image restoration ⋮ Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems ⋮ Convergence of fixed-point continuation algorithms for matrix rank minimization ⋮ A performance guarantee for orthogonal matching pursuit using mutual coherence ⋮ Optimal estimation of \(\ell_1\)-regularization prior from a regularized empirical Bayesian risk standpoint ⋮ Iterative algorithms for total variation-like reconstructions in seismic tomography ⋮ Two-dimensional random projection ⋮ Templates for convex cone problems with applications to sparse signal recovery ⋮ Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing ⋮ Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing ⋮ A projection method for convex constrained monotone nonlinear equations with applications ⋮ Fixed point and Bregman iterative methods for matrix rank minimization ⋮ A non-adapted sparse approximation of PDEs with stochastic inputs ⋮ Sparse approximate solution of partial differential equations ⋮ A numerical exploration of compressed sampling recovery ⋮ Projected Landweber iteration for matrix completion ⋮ Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares ⋮ The distance between convex sets with Minkowski sum structure: application to collision detection ⋮ Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm ⋮ Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method ⋮ A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem ⋮ New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints ⋮ Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection ⋮ Enhancing sparsity of Hermite polynomial expansions by iterative rotations ⋮ Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm ⋮ A gradient descent based algorithm for \(\ell_p\) minimization ⋮ Analysis of compressed distributed adaptive filters ⋮ Numerical analysis for conservation laws using \(l_1\) minimization ⋮ GPU accelerated greedy algorithms for compressed sensing ⋮ Matrix-free interior point method for compressed sensing problems ⋮ SSN: learning sparse switchable normalization via SparsestMax ⋮ Structure exploiting methods for fast uncertainty quantification in multiphase flow through heterogeneous media ⋮ New strong convergence method for the sum of two maximal monotone operators ⋮ Learning ``best kernels from data in Gaussian process regression. With application to aerodynamics ⋮ Sparse representation based two-dimensional direction of arrival estimation using co-prime array ⋮ Convex optimization under combinatorial sparsity constraints ⋮ Generalization bounds for sparse random feature expansions ⋮ Compressed sensing in the spherical near-field to far-field transformation ⋮ Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
This page was built for software: SPGL1
