A method for solving the convex programming problem with convergence rate O(1/k^2)
- Authors
- Yurii Nesterov
- Journal
- Proceedings of the USSR Academy of Sciences
In The Last Decade
doi.org/w7409347 →Countries where authors are citing A method for solving the convex programming problem with convergence rate O(1/k^2)
This map shows the geographic impact of A method for solving the convex programming problem with convergence rate O(1/k^2). 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 A method for solving the convex programming problem with convergence rate O(1/k^2) with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A method for solving the convex programming problem with convergence rate O(1/k^2) more than expected).
Fields of papers citing A method for solving the convex programming problem with convergence rate O(1/k^2)
This network shows the impact of A method for solving the convex programming problem with convergence rate O(1/k^2). Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the A method for solving the convex programming problem with convergence rate O(1/k^2).
About A method for solving the convex programming problem with convergence rate O(1/k^2)
This paper, published in 1983, received 1.3k indexed citations . Written by Yurii Nesterov covering the research area of Industrial and Manufacturing Engineering. It is primarily cited by scholars working on Computational Mechanics (532 citations), Artificial Intelligence (403 citations) and Computer Vision and Pattern Recognition (302 citations). Published in Proceedings of the USSR Academy of Sciences.
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/w7409347.