Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA. Retrieved May 24, 2026, from https://4ort.xyz/entity/using-l1-relaxation-and-integer-programming-to-obtain-dual-bounds-for-sparse-pca
MLA“Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/using-l1-relaxation-and-integer-programming-to-obtain-dual-bounds-for-sparse-pca.
BibTeX@misc{4ortxyz_using-l1-relaxation-and-integer-programming-to-obtain-dual-bounds-for-sparse-pca_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA}}, year = {2026}, url = {https://4ort.xyz/entity/using-l1-relaxation-and-integer-programming-to-obtain-dual-bounds-for-sparse-pca}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA — https://4ort.xyz/entity/using-l1-relaxation-and-integer-programming-to-obtain-dual-bounds-for-sparse-pca (retrieved 2026-05-24)
