On the Equivalence Between a Minimal Codomain Cardinality Riesz Basis Construction, a System of Hadamard–Sylvester Operators, and a Class of Sparse, Binary Optimization Problems

DOI10.1109/TSP.2014.2345346MaRDI QIDQ4579502zbMATH OpenFDO

Authors James D. B. Nelson

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2014.2345346

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(1)

• The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems

This page was built for publication: On the Equivalence Between a Minimal Codomain Cardinality Riesz Basis Construction, a System of Hadamard–Sylvester Operators, and a Class of Sparse, Binary Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579502)