Optimal Algorithms for Binary, Sparse, and L 1-Norm Principal Component Analysis

DOI10.1007/978-1-4939-1124-0_11zbMath1395.90243OpenAlexW7006200MaRDI QIDQ4983084

George N. Karystinos

Publication date: 14 April 2015

Published in: Mathematics Without Boundaries (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-1124-0_11

zbMATH Keywords

complexityalgorithmsquadratic programmingMIMO systemsfeature extractionprincipal component analysiscombinatorial optimizationbinary sequencespolynomial algorithmseigenvalues and eigenfunctionsmachine learningdimensionality reductioninformation processing\(L_1\) normmaximum-likelihood detectionmaximization of quadratic forms\(L_2\) norm0-1 variablesoutlier resistancenoncoherent communicationcode-division multiplexingsubspace signal processing

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Applications of mathematical programming (90C90) Information theory (general) (94A15)

This page was built for publication: Optimal Algorithms for Binary, Sparse, and L 1-Norm Principal Component Analysis