Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix
Impact in
Classified as
- Journal
- IDEALS (University of Illinois Urbana-Champaign)
In The Last Decade
doi.org/w72073141 →Countries where authors are citing Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix
This map shows the geographic impact of Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix more than expected).
Fields of papers citing Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix
This network shows the impact of Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix.
About Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix
This paper, published in 2009, received 345 indexed citations . Written by Zhouchen Lin, Arvind Ganesh, John Wright, Leqin Wu, Minming Chen and Yi Ma covering the research area of Computer Vision and Pattern Recognition, Signal Processing and Computational Mechanics. It is primarily cited by scholars working on Computational Mechanics (192 citations), Computer Vision and Pattern Recognition (187 citations), Signal Processing (79 citations), Media Technology (58 citations) and Artificial Intelligence (46 citations). Published in IDEALS (University of Illinois Urbana-Champaign).
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/w72073141.