Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing
From MaRDI portal
Publication:4579476
DOI10.1109/TSP.2014.2338077zbMath1394.94375arXiv1405.6785OpenAlexW1539726260WikidataQ55921975 ScholiaQ55921975MaRDI QIDQ4579476
Dimitris A. Pados, George N. Karystinos, Panos P. Markopoulos
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6785
Related Items (8)
Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing ⋮ Principal component analysis with drop rank covariance matrix ⋮ Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis ⋮ Avoiding Optimal Mean ℓ2,1-Norm Maximization-Based Robust PCA for Reconstruction ⋮ On the robust PCA and Weiszfeld's algorithm ⋮ F-norm distance metric based robust 2DPCA and face recognition ⋮ Optimization for L1-Norm Error Fitting via Data Aggregation ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching
This page was built for publication: Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing