Michael J. Todd

11.8k total citations · 4 hit papers
134 papers, 7.6k citations indexed

About

Michael J. Todd is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Control and Systems Engineering. According to data from OpenAlex, Michael J. Todd has authored 134 papers receiving a total of 7.6k indexed citations (citations by other indexed papers that have themselves been cited), including 101 papers in Numerical Analysis, 92 papers in Computational Theory and Mathematics and 21 papers in Control and Systems Engineering. Recurrent topics in Michael J. Todd's work include Advanced Optimization Algorithms Research (96 papers), Optimization and Variational Analysis (31 papers) and Matrix Theory and Algorithms (28 papers). Michael J. Todd is often cited by papers focused on Advanced Optimization Algorithms Research (96 papers), Optimization and Variational Analysis (31 papers) and Matrix Theory and Algorithms (28 papers). Michael J. Todd collaborates with scholars based in United States, United Kingdom and Singapore. Michael J. Todd's co-authors include Kim-Chuan Toh, Reha Tütüncü, Yu. E. Nesterov, Yinyu Ye, Donald Goldfarb, Shinji Mizuno, Robert G. Bland, J. S. Marron, Arkadi Nemirovski and E. Alper Yıldırım and has published in prestigious journals such as Journal of the American Statistical Association, European Journal of Operational Research and Operations Research.

In The Last Decade

Michael J. Todd

131 papers receiving 6.9k citations

Hit Papers

SDPT3 — A Matlab software package for semidefinite progra... 1996 2026 2006 2016 1999 2003 1996 1997 400 800 1.2k

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michael J. Todd United States 34 3.4k 3.2k 1.6k 1.5k 874 134 7.6k
Andrew R. Conn United States 33 3.7k 1.1× 3.5k 1.1× 1.5k 1.0× 1.7k 1.1× 1.0k 1.2× 91 8.4k
Claude Lemaréchal France 29 3.0k 0.9× 3.2k 1.0× 1.1k 0.7× 1.8k 1.2× 688 0.8× 58 7.7k
E. Polak United States 41 3.1k 0.9× 3.3k 1.0× 2.6k 1.6× 1.3k 0.9× 572 0.7× 210 9.3k
Reiner Horst Germany 28 3.1k 0.9× 3.0k 0.9× 1.5k 1.0× 613 0.4× 627 0.7× 65 6.1k
Paul Tseng United States 42 3.4k 1.0× 3.5k 1.1× 646 0.4× 2.3k 1.5× 541 0.6× 103 6.7k
Jean B. Lasserre France 40 3.0k 0.9× 3.1k 1.0× 2.3k 1.5× 879 0.6× 617 0.7× 296 8.4k
B. T. Polyak Russia 25 2.4k 0.7× 2.2k 0.7× 1.2k 0.8× 1.9k 1.2× 383 0.4× 87 6.7k
Layne T. Watson United States 49 1.7k 0.5× 3.4k 1.0× 861 0.5× 1.5k 1.0× 508 0.6× 403 9.7k
Henry Wolkowicz Canada 35 2.5k 0.7× 2.8k 0.9× 636 0.4× 1.2k 0.8× 919 1.1× 126 5.1k
Adrian S. Lewis United States 40 2.3k 0.7× 2.7k 0.8× 899 0.6× 1.9k 1.2× 358 0.4× 132 6.0k

Countries citing papers authored by Michael J. Todd

Since Specialization
Citations

This map shows the geographic impact of Michael J. Todd'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 Michael J. Todd with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael J. Todd more than expected).

Fields of papers citing papers by Michael J. Todd

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael J. Todd. 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 Michael J. Todd. The network helps show where Michael J. Todd may publish in the future.

Co-authorship network of co-authors of Michael J. Todd

This figure shows the co-authorship network connecting the top 25 collaborators of Michael J. Todd. A scholar is included among the top collaborators of Michael J. Todd 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 Michael J. Todd. Michael J. Todd is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ahipaşaoğlu, Selin Damla & Michael J. Todd. (2011). A modified Frank–Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms. Computational Geometry. 46(5). 494–519. 7 indexed citations
2.
Todd, Michael J. & E. Alper Yıldırım. (2007). On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids. Discrete Applied Mathematics. 155(13). 1731–1744. 137 indexed citations
3.
Todd, Michael J.. (2007). Largest dual ellipsoids inscribed in dual cones. Mathematical Programming. 117(1-2). 425–434. 3 indexed citations
4.
Todd, Michael J., et al.. (1998). Probabilistic analysis of two complexity measures for linear programming problems. eCommons (Cornell University). 9 indexed citations
5.
Mizuno, Shinji, Michael J. Todd, & Yinyu Ye. (1995). A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming. Mathematics of Operations Research. 20(1). 135–162. 21 indexed citations
6.
Tütüncü, Reha & Michael J. Todd. (1995). Reducing horizontal linear complementarity problems. Linear Algebra and its Applications. 223-224. 717–729. 33 indexed citations
7.
Todd, Michael J.. (1994). Scaling, shifting and weighting in interior-point methods. Computational Optimization and Applications. 3(4). 305–315. 6 indexed citations
8.
Ye, Yinyu, Michael J. Todd, & Shinji Mizuno. (1994). An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm. Mathematics of Operations Research. 19(1). 53–67. 198 indexed citations
9.
Khachiyan, Leonid G. & Michael J. Todd. (1993). On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Mathematical Programming. 61(1-3). 137–159. 100 indexed citations
10.
Todd, Michael J.. (1991). The affine-scaling direction for linear programming is a limit of projective-scaling directions. Linear Algebra and its Applications. 152. 93–105. 2 indexed citations
11.
Morris, Walter D. & Michael J. Todd. (1988). Symmetry and Positive Definiteness in Oriented Matroids. European Journal of Combinatorics. 9(2). 121–129. 6 indexed citations
12.
Mitchell, John E. & Michael J. Todd. (1986). On the Relationship Between the Search Directions in the Affine and Projective Variants of Karmarkar's Linear Programming Algorithm. eCommons (Cornell University). 52(2). 141–7. 7 indexed citations
13.
Todd, Michael J.. (1985). Linear and quadratic programming in oriented matroids. Journal of Combinatorial Theory Series B. 39(2). 105–133. 23 indexed citations
14.
Adler, Ilan, Nimrod Megiddo, & Michael J. Todd. (1984). New results on the average behavior of simplex algorithms. Bulletin of the American Mathematical Society. 11(2). 378–382. 12 indexed citations
15.
Todd, Michael J.. (1982). On the computational complexity of piecewise-linear homotopy algorithms. Mathematical Programming. 24(1). 216–224. 9 indexed citations
16.
Freund, Robert M. & Michael J. Todd. (1981). A constructive proof of Tucker's combinatorial lemma. Journal of Combinatorial Theory Series A. 30(3). 321–325. 26 indexed citations
17.
Todd, Michael J.. (1981). Variable dimension fixed point algorithms and triangulations. European Journal of Operational Research. 8(3). 309–310. 9 indexed citations
18.
Todd, Michael J., et al.. (1977). Thermal conductance across ball bearings in vacuum. NASA STI/Recon Technical Report N. 78. 26405. 4 indexed citations
19.
Todd, Michael J.. (1976). Characterizing binary simplical matroids. Discrete Mathematics. 16(1). 61–70. 3 indexed citations
20.
Todd, Michael J.. (1973). Complementarity Algorithms without Rays. Biochimica et Biophysica Acta. 1282(2). 182–92. 1 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026