Robert M. Freund

7.7k total citations · 2 hit papers
84 papers, 4.3k citations indexed

About

Robert M. Freund is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Computational Mechanics. According to data from OpenAlex, Robert M. Freund has authored 84 papers receiving a total of 4.3k indexed citations (citations by other indexed papers that have themselves been cited), including 58 papers in Numerical Analysis, 57 papers in Computational Theory and Mathematics and 23 papers in Computational Mechanics. Recurrent topics in Robert M. Freund's work include Advanced Optimization Algorithms Research (58 papers), Sparse and Compressive Sensing Techniques (21 papers) and Optimization and Variational Analysis (18 papers). Robert M. Freund is often cited by papers focused on Advanced Optimization Algorithms Research (58 papers), Sparse and Compressive Sensing Techniques (21 papers) and Optimization and Variational Analysis (18 papers). Robert M. Freund collaborates with scholars based in United States, Singapore and Chile. Robert M. Freund's co-authors include Federico Girosi, E. Osuna, Charles H. Fine, Jorge Vera, Peng Sun, Alexandre Belloni, Haihao Lu, Marina A. Epelman, Yurii Nesterov and J. Peraire and has published in prestigious journals such as Management Science, Journal of Computational Physics and Mathematics of Computation.

In The Last Decade

Robert M. Freund

81 papers receiving 3.9k citations

Hit Papers

Training support vector machines: an application to face ... 2002 2026 2010 2018 2002 2002 500 1000 1.5k

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Robert M. Freund United States 25 1.6k 1.2k 793 788 512 84 4.3k
Dorit S. Hochbaum United States 40 694 0.4× 823 0.7× 183 0.2× 1.8k 2.3× 434 0.8× 163 6.2k
Nimrod Megiddo United States 43 955 0.6× 1.7k 1.4× 1.2k 1.5× 2.7k 3.4× 405 0.8× 150 8.5k
Hoai An Le Thi France 27 586 0.4× 686 0.6× 1.3k 1.6× 1.1k 1.4× 425 0.8× 144 3.3k
Rainer E. Burkard Austria 31 374 0.2× 699 0.6× 327 0.4× 1.1k 1.3× 573 1.1× 131 4.8k
Patrick Siarry France 38 1.1k 0.7× 2.8k 2.4× 238 0.3× 1.8k 2.3× 1.1k 2.1× 196 7.1k
Anatoli Juditsky France 23 555 0.3× 2.4k 2.0× 353 0.4× 404 0.5× 1.7k 3.3× 68 5.1k
H. T. Kung United States 39 634 0.4× 1.5k 1.3× 684 0.9× 1.8k 2.3× 191 0.4× 171 7.6k
Kenneth Steiglitz United States 19 843 0.5× 1.2k 1.0× 165 0.2× 1.1k 1.4× 306 0.6× 45 5.2k
B. T. Polyak Russia 25 655 0.4× 1.7k 1.4× 2.4k 3.0× 2.2k 2.8× 1.2k 2.4× 87 6.7k
Sanyang Liu China 32 708 0.4× 2.7k 2.3× 551 0.7× 2.1k 2.6× 850 1.7× 389 6.2k

Countries citing papers authored by Robert M. Freund

Since Specialization
Citations

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

Fields of papers citing papers by Robert M. Freund

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Robert M. Freund

This figure shows the co-authorship network connecting the top 25 collaborators of Robert M. Freund. A scholar is included among the top collaborators of Robert M. Freund 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 Robert M. Freund. Robert M. Freund 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.
Xiong, Zikai & Robert M. Freund. (2024). Using Taylor-Approximated Gradients to Improve the Frank–Wolfe Method for Empirical Risk Minimization. SIAM Journal on Optimization. 34(3). 2503–2534.
2.
Freund, Robert M., et al.. (2024). Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses. Mathematical Programming. 213(1-2). 1–49. 2 indexed citations
3.
Freund, Robert M., et al.. (2017). A new perspective on boosting in linear regression via subgradient optimization and relatives. Project Euclid (Cornell University). 16 indexed citations
4.
Freund, Robert M., et al.. (2014). Robust topology optimization of three-dimensional photonic-crystal band-gap structures. DSpace@MIT (Massachusetts Institute of Technology). 83 indexed citations
5.
Nguyen, Ngoc Cuong, et al.. (2011). Design of photonic crystals with multiple and combined band gaps. Physical Review E. 83(4). 46703–46703. 30 indexed citations
6.
Bertsimas, Dimitris, Robert M. Freund, & Xu Andy Sun. (2011). An Accelerated First-Order Method for Solving Unconstrained Polynomial Optimization Problems. 1 indexed citations
7.
Anišić, Zoran, et al.. (2009). Web based intelligent product configurator for thermal insulation and decoration of buildings. 82. 253–258. 3 indexed citations
8.
Belloni, Alexandre & Robert M. Freund. (2006). On the symmetry function of a convex set. Mathematical Programming. 111(1-2). 57–93. 11 indexed citations
9.
Freund, Robert M. & Jorge Vera. (2003). On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System. Mathematics of Operations Research. 28(4). 625–648. 12 indexed citations
10.
Osuna, E., Robert M. Freund, & Federico Girosi. (2002). An improved training algorithm for support vector machines. 276–285. 688 indexed citations breakdown →
11.
Freund, Robert M.. (2001). On the primal-duty geometry of level sets in linear and conic optimization. DSpace@MIT (Massachusetts Institute of Technology). 15 indexed citations
12.
Epelman, Marina A. & Robert M. Freund. (2000). Pre-Conditioners and Relations between Different Measures of Conditioning for Conic Linear Systems. DSpace@MIT (Massachusetts Institute of Technology). 3 indexed citations
13.
Freund, Robert M.. (1996). Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm. Mathematics of Operations Research. 21(4). 839–859. 1 indexed citations
14.
Birge, John R., Robert M. Freund, & Robert J. Vanderbei. (1992). Prior reduced fill-in in solving equations in interior point algorithms. Operations Research Letters. 11(4). 195–198. 6 indexed citations
15.
Freund, Robert M.. (1991). Theoretical efficiency of a shifted-barrier-function algorithm for linear programming. Linear Algebra and its Applications. 152. 19–41. 24 indexed citations
16.
Freund, Robert M.. (1989). On polynomial approximations to f a (Z)(z-a)−1 with complex a and some applications to certain non-hermitian matrices. Approximation Theory and Its Applications. 5(1). 15–31. 8 indexed citations
17.
Freund, Robert M.. (1989). Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron. Journal of Combinatorial Theory Series B. 47(2). 192–219. 9 indexed citations
18.
Freund, Robert M.. (1987). A note on two block-SOR methods for sparse least squares problems. Linear Algebra and its Applications. 88-89. 211–221. 24 indexed citations
19.
Freund, Robert M.. (1987). Dual gauge programs, with applications to quadratic programming and the minimum-norm problem. Mathematical Programming. 38(1). 47–67. 22 indexed citations
20.
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

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