Samuel Burer

4.6k total citations · 2 hit papers
60 papers, 2.8k citations indexed

About

Samuel Burer is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Computational Mechanics. According to data from OpenAlex, Samuel Burer has authored 60 papers receiving a total of 2.8k indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Numerical Analysis, 42 papers in Computational Theory and Mathematics and 18 papers in Computational Mechanics. Recurrent topics in Samuel Burer's work include Advanced Optimization Algorithms Research (43 papers), Complexity and Algorithms in Graphs (27 papers) and Sparse and Compressive Sensing Techniques (17 papers). Samuel Burer is often cited by papers focused on Advanced Optimization Algorithms Research (43 papers), Complexity and Algorithms in Graphs (27 papers) and Sparse and Compressive Sensing Techniques (17 papers). Samuel Burer collaborates with scholars based in United States, United Kingdom and Netherlands. Samuel Burer's co-authors include Renato D. C. Monteiro, Adam N. Letchford, Dieter Vandenbussche, Kurt M. Anstreicher, Yi Zhang, W. Nick Street, Yin Zhang, Yin Zhang, Guanglin Xu and Philip C. Jones and has published in prestigious journals such as European Journal of Operational Research, Journal of Machine Learning Research and Mathematical Programming.

In The Last Decade

Samuel Burer

59 papers receiving 2.6k citations

Hit Papers

align trajectories

What are hit papers?

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.

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

2003 448 citations Samuel Burer, Renato D. C. Monteiro Mathematical Programming profile →
Non-convex mixed-integer nonlinear programming: A survey

2012 379 citations Samuel Burer et al. profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Samuel Burer United States	26	1.3k	1.2k	702	545	388	60	2.8k
Hoai An Le Thi France	27	1.3k 1.0×	1.1k 0.9×	1.0k 1.5×	686 1.3×	331 0.9×	144	3.3k
Jacek Gondzio United Kingdom	29	1.1k 0.8×	968 0.8×	434 0.6×	271 0.5×	318 0.8×	109	2.5k
Elizabeth D. Dolan United States	5	2.2k 1.6×	1.7k 1.3×	889 1.3×	461 0.8×	165 0.4×	7	3.2k
Farid Alizadeh United States	13	1.5k 1.1×	1.5k 1.2×	557 0.8×	251 0.5×	271 0.7×	29	2.7k
Stephen A. Vavasis United States	29	584 0.4×	1.0k 0.8×	710 1.0×	392 0.7×	335 0.9×	72	2.8k
Krzysztof C. Kiwiel Poland	28	1.7k 1.3×	1.6k 1.3×	1.0k 1.5×	301 0.6×	207 0.5×	76	2.7k
Jonathan Eckstein United States	22	1.4k 1.0×	1.5k 1.2×	1.4k 2.0×	314 0.6×	191 0.5×	58	3.5k
Franz Rendl Austria	29	1.4k 1.1×	1.8k 1.4×	582 0.8×	689 1.3×	531 1.4×	82	3.8k
Stefano Lucidi Italy	34	2.3k 1.8×	2.0k 1.6×	824 1.2×	712 1.3×	360 0.9×	117	3.9k
J. B. Rosen United States	27	1.4k 1.1×	1.4k 1.1×	416 0.6×	427 0.8×	287 0.7×	92	3.5k

Countries citing papers authored by Samuel Burer

Since Specialization

Citations

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

Fields of papers citing papers by Samuel Burer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Samuel Burer

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Burer, Samuel, et al.. (2026). Code and Data Repository for An Extended Validity Domain for Constraint Learning. INFORMS journal on computing.

Burer, Samuel. (2024). A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints. Mathematical Programming. 211(1-2). 157–179. 1 indexed citations

Burer, Samuel, et al.. (2023). A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold. Journal of Optimization Theory and Applications. 202(1). 320–339. 1 indexed citations

Burer, Samuel & Yinyu Ye. (2021). Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Mathematical Programming. 190(1-2). 845–848. 2 indexed citations

Burer, Samuel & Yinyu Ye. (2019). Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Mathematical Programming. 181(1). 1–17. 33 indexed citations

Burer, Samuel & Veronica Piccialli. (2018). Three methods for robust grading. European Journal of Operational Research. 272(1). 364–371. 2 indexed citations

Anstreicher, Kurt M., et al.. (2017). Quadratic programs with hollows. Mathematical Programming. 170(2). 541–553. 11 indexed citations

Burer, Samuel & Fatma Kılınç-Karzan. (2016). How to convexify the intersection of a second order cone and a nonconvex quadratic. Mathematical Programming. 162(1-2). 393–429. 17 indexed citations

Xu, Guanglin & Samuel Burer. (2016). Robust sensitivity analysis of the optimal value of linear programming. Optimization methods & software. 32(6). 1187–1205. 3 indexed citations

10.

Burer, Samuel, et al.. (2016). Nearly-efficient tuitions and subsidies in American public higher education. Economics of Education Review. 55. 182–197. 3 indexed citations

11.

Burer, Samuel. (2012). Robust Rankings for College Football. Journal of Quantitative Analysis in Sports. 8(2). 5 indexed citations

12.

Burer, Samuel, et al.. (2009). A p -cone sequential relaxation procedure for 0-1 integer programs. Optimization methods & software. 24(4-5). 523–548. 5 indexed citations

13.

Burer, Samuel, Kurt M. Anstreicher, & Mirjam Dür. (2009). The difference between 5×5 doubly nonnegative and completely positive matrices. Linear Algebra and its Applications. 431(9). 1539–1552. 29 indexed citations

14.

Burer, Samuel, et al.. (2009). Relaxing the optimality conditions of box QP. Computational Optimization and Applications. 48(3). 653–673. 3 indexed citations

15.

Burer, Samuel, et al.. (2007). Computational enhancements and applications in low-rank semidefinite programming. 1 indexed citations

16.

Zhang, Yi, Samuel Burer, & W. Nick Street. (2006). Ensemble Pruning Via Semi-definite Programming. Journal of Machine Learning Research. 7(48). 1315–1338. 188 indexed citations

17.

Burer, Samuel, Philip C. Jones, & Timothy J. Lowe. (2006). Coordinating the supply chain in the agricultural seed industry. European Journal of Operational Research. 185(1). 354–377. 57 indexed citations

18.

Anstreicher, Kurt M. & Samuel Burer. (2005). D.C. Versus Copositive Bounds for Standard QP. Journal of Global Optimization. 33(2). 299–312. 22 indexed citations

19.

Burer, Samuel, Renato D. C. Monteiro, & Yin Zhang. (2002). Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. SIAM Journal on Optimization. 12(2). 503–521. 132 indexed citations

20.

Burer, Samuel, Renato D. C. Monteiro, & Yin Zhang. (2002). Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. Computational Optimization and Applications. 22(1). 49–79. 12 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