Samuel Burer - RankMe

51 papers A* 1Journal 49

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Semidefinite Relaxation for Sums of Heterogeneous Quadratic Forms on the Stiefel Manifold. SIAM J. Matrix Anal. Appl. Kyle Gilman, Samuel Burer, Laura Balzano
2025	J	`jnl`	A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints. Math. Program. Samuel Burer
2024	J	`jnl`	A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold. J. Optim. Theory Appl. Samuel Burer, Kyungchan Park
2023	J	`jnl`	Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow. Math. Program. Anders Eltved, Samuel Burer
2021	J	`jnl`	Convex hull representations for bounded products of variables. J. Glob. Optim. Kurt M. Anstreicher, Samuel Burer, Kyungchan Park
2021	J	`jnl`	Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. Samuel Burer, Yinyu Ye
2021	J	`jnl`	Quadratic optimization with switching variables: the convex hull for n=2. Math. Program. Kurt M. Anstreicher, Samuel Burer
2020	J	`jnl`	Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. Samuel Burer, Yinyu Ye
2019	J	`jnl`	Three methods for robust grading. Eur. J. Oper. Res. Samuel Burer, Veronica Piccialli
2018	J	`jnl`	A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. Comput. Optim. Appl. Guanglin Xu, Samuel Burer
2018	J	`jnl`	A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming. Comput. Manag. Sci. Guanglin Xu, Samuel Burer
2018	J	`jnl`	Quadratic programs with hollows. Math. Program. Boshi Yang, Kurt M. Anstreicher, Samuel Burer
2017	J	`jnl`	A branch-and-bound algorithm for instrumental variable quantile regression. Math. Program. Comput. Guanglin Xu, Samuel Burer
2017	J	`jnl`	How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. Samuel Burer, Fatma Kilinç-Karzan
2017	J	`jnl`	Robust sensitivity analysis of the optimal value of linear programming. Optim. Methods Softw. Guanglin Xu, Samuel Burer
2016	J	`jnl`	A Two-Variable Approach to the Two-Trust-Region Subproblem. SIAM J. Optim. Boshi Yang, Samuel Burer
2015	J	`jnl`	A gentle, geometric introduction to copositive optimization. Math. Program. Samuel Burer
2015	J	`jnl`	The trust region subproblem with non-intersecting linear constraints. Math. Program. Samuel Burer, Boshi Yang
2014	J	`jnl`	A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs. SIAM J. Optim. Jieqiu Chen, Samuel Burer
2014	J	`jnl`	Faster, but weaker, relaxations for quadratically constrained quadratic programs. Comput. Optim. Appl. Samuel Burer, Sunyoung Kim, Masakazu Kojima
2014	J	`jnl`	Unbounded convex sets for non-convex mixed-integer quadratic programming. Math. Program. Samuel Burer, Adam N. Letchford
2013	J	`jnl`	Second-Order-Cone Constraints for Extended Trust-Region Subproblems. SIAM J. Optim. Samuel Burer, Kurt M. Anstreicher
2013	J	`jnl`	Separation and relaxation for cones of quadratic forms. Math. Program. Samuel Burer, Hongbo Dong
2012	J	`jnl`	Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. Jieqiu Chen, Samuel Burer
2012	J	`jnl`	Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. Samuel Burer, Hongbo Dong
2011	J	`jnl`	Relaxing the optimality conditions of box QP. Comput. Optim. Appl. Samuel Burer, Jieqiu Chen
2010	J	`jnl`	Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. Kurt M. Anstreicher, Samuel Burer
2010	J	`jnl`	Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Program. Comput. Samuel Burer
2009	J	`jnl`	A Optim. Methods Softw. Samuel Burer, Jieqiu Chen
2009	J	`jnl`	Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. Samuel Burer, Dieter Vandenbussche
2009	J	`jnl`	On Nonconvex Quadratic Programming with Box Constraints. SIAM J. Optim. Samuel Burer, Adam N. Letchford
2009	J	`jnl`	On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. Samuel Burer
2008	J	`jnl`	A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. Samuel Burer, Dieter Vandenbussche
2008	J	`jnl`	Coordinating the supply chain in the agricultural seed industry. Eur. J. Oper. Res. Samuel Burer, Philip C. Jones, Timothy J. Lowe
2007	J	`jnl`	On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization. SIAM J. Optim. Miguel F. Anjos, Samuel Burer
2007	J	`jnl`	Solving maximum-entropy sampling problems using factored masks. Math. Program. Samuel Burer, Jon Lee
2006	J	`jnl`	Computational enhancements in low-rank semidefinite programming. Optim. Methods Softw. Samuel Burer, Changhui Choi
2006	J	`jnl`	Ensemble Pruning Via Semi-definite Programming. J. Mach. Learn. Res. Yi Zhang, Samuel Burer, W. Nick Street
2006	J	`jnl`	Solving Lift-and-Project Relaxations of Binary Integer Programs. SIAM J. Optim. Samuel Burer, Dieter Vandenbussche
2005	J	`jnl`	D.C. Versus Copositive Bounds for Standard QP. J. Glob. Optim. Kurt M. Anstreicher, Samuel Burer
2005	J	`jnl`	Local Minima and Convergence in Low-Rank Semidefinite Programming. Math. Program. Samuel Burer, Renato D. C. Monteiro
2005	A*	`conf`	Sharing Classifiers among Ensembles from Related Problem Domains. ICDM Yi Zhang, W. Nick Street, Samuel Burer
2003	J	`jnl`	A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming. Optim. Methods Softw. Samuel Burer, Renato D. C. Monteiro
2003	J	`jnl`	A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. Math. Program. Samuel Burer, Renato D. C. Monteiro, Yin Zhang
2003	J	`jnl`	A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. Samuel Burer, Renato D. C. Monteiro
2003	J	`jnl`	Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices. SIAM J. Optim. Samuel Burer
2002	J	`jnl`	Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. Comput. Optim. Appl. Samuel Burer, Renato D. C. Monteiro, Yin Zhang
2002	J	`jnl`	Maximum stable set formulations and heuristics based on continuous optimization. Math. Program. Samuel Burer, Renato D. C. Monteiro, Yin Zhang
2002	J	`jnl`	Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. SIAM J. Optim. Samuel Burer, Renato D. C. Monteiro, Yin Zhang
2002	J	`jnl`	Solving a class of semidefinite programs via nonlinear programming. Math. Program. Samuel Burer, Renato D. C. Monteiro, Yin Zhang
2001	—	`—`	New algorithmic approaches for semidefinite programming with applications to combinatorial optimization. Samuel Burer