Sparse Approximate Solutions to Linear Systems
From MaRDI portal
Publication:4834376
DOI10.1137/S0097539792240406zbMath0827.68054WikidataQ56688857 ScholiaQ56688857MaRDI QIDQ4834376
Publication date: 13 December 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Unnamed Item ⋮ Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity ⋮ Fluorescence image deconvolution microscopy via generative adversarial learning (FluoGAN) ⋮ Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm ⋮ A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization ⋮ Grouped variable selection with discrete optimization: computational and statistical perspectives ⋮ Weak and strong convergence analysis of Elman neural networks via weight decay regularization ⋮ Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints ⋮ Simultaneous feature selection and outlier detection with optimality guarantees ⋮ On sparse approximations of solutions to linear systems with orthogonal matrices ⋮ Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model ⋮ Solution sets of three sparse optimization problems for multivariate regression ⋮ Sparse reconstruction via the mixture optimization model with iterative support estimate ⋮ A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates ⋮ A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance ⋮ A communication-efficient method for ℓ0 regularization linear regression models ⋮ Neural network for a class of sparse optimization with \(L_0\)-regularization ⋮ Sparse signal reconstruction via recurrent neural networks with hyperbolic tangent function ⋮ Neurodynamic approaches for sparse recovery problem with linear inequality constraints ⋮ Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization ⋮ Time‐optimal L1/L2 norms optimal control for linear time‐invariant systems ⋮ A unifying framework for sparsity-constrained optimization ⋮ Sparse convex optimization toolkit: a mixed-integer framework ⋮ Comparing different stabilization strategies for reduced order modeling of viscoelastic fluid flow problems ⋮ Proximal variable metric method with spectral diagonal update for large scale sparse optimization ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery ⋮ Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint ⋮ Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ A wonderful triangle in compressed sensing ⋮ Discovering interpretable elastoplasticity models via the neural polynomial method enabled symbolic regressions ⋮ Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing ⋮ A neurodynamic algorithm for sparse signal reconstruction with finite-time convergence ⋮ Sparse control for continuous‐time systems ⋮ \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery ⋮ LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing ⋮ An automated exact solution framework towards solving the logistic regression best subset selection problem ⋮ Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection ⋮ A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization ⋮ A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm ⋮ A reduced half thresholding algorithm ⋮ Sparse regression for data-driven deterrence functions in gravity models ⋮ Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval ⋮ A majorization penalty method for SVM with sparse constraint ⋮ Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing ⋮ A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion ⋮ A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems ⋮ On sparsity‐inducing methods in system identification and state estimation ⋮ Scaled proximal gradient methods for sparse optimization problems ⋮ Identifying stochastic governing equations from data of the most probable transition trajectories ⋮ Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors ⋮ Subset Selection and the Cone of Factor-Width-k Matrices ⋮ Representation recovery via \(L_1\)-norm minimization with corrupted data ⋮ Unnamed Item ⋮ An unbiased approach to compressed sensing ⋮ An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression ⋮ Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators ⋮ A tree-based dictionary learning framework ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ Scalable Algorithms for the Sparse Ridge Regression ⋮ Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing ⋮ The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty ⋮ An interpretable classification method for predicting drug resistance in \(M. tuberculosis\) ⋮ Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms ⋮ COMBSS: best subset selection via continuous optimization ⋮ Best subset selection for high-dimensional non-smooth models using iterative hard thresholding ⋮ Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame ⋮ A Scale-Invariant Approach for Sparse Signal Recovery ⋮ Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems ⋮ Sparse reconstructions from few noisy data: analysis of hierarchical Bayesian models with generalized gamma hyperpriors ⋮ Random Projections for Linear Programming ⋮ Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases ⋮ Unnamed Item ⋮ Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function ⋮ Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms ⋮ Uniqueness Conditions for A Class of ℓ0-Minimization Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sampling in Image Representation and Compression ⋮ Optimal Diversification in the Presence of Parameter Uncertainty for a Risk Averse Investor ⋮ Supervised pre-clustering for sparse regression ⋮ Unnamed Item ⋮ Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms ⋮ Combining a relaxed EM algorithm with Occam's razor for Bayesian variable selection in high-dimensional regression ⋮ Best subset selection via a modern optimization lens ⋮ Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ MOEA/D with chain-based random local search for sparse optimization ⋮ Operator theoretic framework for optimal placement of sensors and actuators for control of nonequilibrium dynamics ⋮ Local search methods for \(\ell_{1}\)-minimization in frame based signal compression ⋮ Near-ideal model selection by \(\ell _{1}\) minimization ⋮ Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios ⋮ Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) ⋮ Sparse solutions of linear complementarity problems ⋮ Global optimization for low-dimensional switching linear regression and bounded-error estimation ⋮ DC approximation approaches for sparse optimization ⋮ Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems ⋮ The non-convex sparse problem with nonnegative constraint for signal reconstruction
This page was built for publication: Sparse Approximate Solutions to Linear Systems
