Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
This map shows the geographic impact of J.F. Sturm's research. 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 J.F. Sturm with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J.F. Sturm more than expected).
This network shows the impact of papers produced by J.F. Sturm. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by J.F. Sturm. The network helps show where J.F. Sturm may publish in the future.
Co-authorship network of co-authors of J.F. Sturm
This figure shows the co-authorship network connecting the top 25 collaborators of J.F. Sturm.
A scholar is included among the top collaborators of J.F. Sturm based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with J.F. Sturm. J.F. Sturm is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sturm, J.F., et al.. (1997). Duality Results for Conic Convex Programming. RePub (Erasmus University Rotterdam).29 indexed citations
14.
Holder, Allen, et al.. (1997). Analytic Central Path, Sensitivity Analysis and Parametric Linear Programming. Data Archiving and Networked Services (DANS).1 indexed citations
Sturm, J.F., et al.. (1996). Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. EUR Research Repository (Erasmus University Rotterdam).3 indexed citations
17.
Sturm, J.F., et al.. (1996). On the long step path--following method for semidefinite programming. EUR Research Repository (Erasmus University Rotterdam).1 indexed citations
18.
Sturm, J.F., et al.. (1996). On Weighted Centers for Semidefinite Programming. EUR Research Repository (Erasmus University Rotterdam).3 indexed citations
19.
Berkelaar, Arjan, J.F. Sturm, & Shuzhong Zhang. (1996). Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming. RePEc: Research Papers in Economics.2 indexed citations
20.
Sturm, J.F., et al.. (1995). Symmetric primal-dual path following algorithms for semidefinite programming. EUR Research Repository (Erasmus University Rotterdam).14 indexed citations
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.