default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamuel Burer
Person information
- affiliation: University of Iowa, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j48]Samuel Burer
, Kyungchan Park:
A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold. J. Optim. Theory Appl. 202(1): 320-339 (2024)- 2023
- [j47]Anders Eltved, Samuel Burer:
Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow. Math. Program. 197(1): 281-306 (2023) - 2021
- [j46]Kurt M. Anstreicher, Samuel Burer, Kyungchan Park:
Convex hull representations for bounded products of variables. J. Glob. Optim. 80(4): 757-778 (2021) - [j45]Kurt M. Anstreicher, Samuel Burer:
Quadratic optimization with switching variables: the convex hull for n=2. Math. Program. 188(2): 421-441 (2021) - [j44]Samuel Burer, Yinyu Ye:
Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. 190(1): 845-848 (2021) - 2020
- [j43]Samuel Burer, Yinyu Ye:
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. 181(1): 1-17 (2020)
2010 – 2019
- 2019
- [j42]Samuel Burer, Veronica Piccialli:
Three methods for robust grading. Eur. J. Oper. Res. 272(1): 364-371 (2019) - 2018
- [j41]Guanglin Xu, Samuel Burer:
A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming. Comput. Manag. Sci. 15(1): 111-134 (2018) - [j40]Guanglin Xu, Samuel Burer:
A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. Comput. Optim. Appl. 70(1): 33-59 (2018) - [j39]Boshi Yang, Kurt M. Anstreicher, Samuel Burer:
Quadratic programs with hollows. Math. Program. 170(2): 541-553 (2018) - 2017
- [j38]Alper Atamtürk, Sam Burer:
Editorial. Discret. Optim. 24: 1-2 (2017) - [j37]Samuel Burer, Fatma Kilinç-Karzan:
How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162(1-2): 393-429 (2017) - [j36]Guanglin Xu, Samuel Burer:
A branch-and-bound algorithm for instrumental variable quantile regression. Math. Program. Comput. 9(4): 471-497 (2017) - [j35]Guanglin Xu, Samuel Burer:
Robust sensitivity analysis of the optimal value of linear programming. Optim. Methods Softw. 32(6): 1187-1205 (2017) - 2016
- [j34]Boshi Yang, Samuel Burer:
A Two-Variable Approach to the Two-Trust-Region Subproblem. SIAM J. Optim. 26(1): 661-680 (2016) - 2015
- [j33]Samuel Burer, Boshi Yang:
The trust region subproblem with non-intersecting linear constraints. Math. Program. 149(1-2): 253-264 (2015) - [j32]Samuel Burer:
A gentle, geometric introduction to copositive optimization. Math. Program. 151(1): 89-116 (2015) - 2014
- [j31]Samuel Burer, Sunyoung Kim, Masakazu Kojima:
Faster, but weaker, relaxations for quadratically constrained quadratic programs. Comput. Optim. Appl. 59(1-2): 27-45 (2014) - [j30]Samuel Burer, Adam N. Letchford:
Unbounded convex sets for non-convex mixed-integer quadratic programming. Math. Program. 143(1-2): 231-256 (2014) - [j29]Jieqiu Chen, Samuel Burer:
A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs. SIAM J. Optim. 24(2): 598-620 (2014) - 2013
- [j28]Samuel Burer, Hongbo Dong:
Separation and relaxation for cones of quadratic forms. Math. Program. 137(1-2): 343-370 (2013) - [j27]Samuel Burer, Kurt M. Anstreicher:
Second-Order-Cone Constraints for Extended Trust-Region Subproblems. SIAM J. Optim. 23(1): 432-451 (2013) - 2012
- [j26]Jieqiu Chen, Samuel Burer:
Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1): 33-52 (2012) - [j25]Samuel Burer, Hongbo Dong:
Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40(3): 203-206 (2012) - 2011
- [j24]Samuel Burer, Jieqiu Chen:
Relaxing the optimality conditions of box QP. Comput. Optim. Appl. 48(3): 653-673 (2011) - 2010
- [j23]Kurt M. Anstreicher, Samuel Burer:
Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124(1-2): 33-43 (2010) - [j22]Samuel Burer:
Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Program. Comput. 2(1): 1-19 (2010)
2000 – 2009
- 2009
- [j21]Samuel Burer, Dieter Vandenbussche:
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. 43(2): 181-195 (2009) - [j20]Samuel Burer:
On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2): 479-495 (2009) - [j19]Samuel Burer, Jieqiu Chen:
A p-cone sequential relaxation procedure for 0-1 integer programs. Optim. Methods Softw. 24(4-5): 523-548 (2009) - [j18]Samuel Burer, Adam N. Letchford:
On Nonconvex Quadratic Programming with Box Constraints. SIAM J. Optim. 20(2): 1073-1089 (2009) - 2008
- [j17]Samuel Burer, Philip C. Jones, Timothy J. Lowe:
Coordinating the supply chain in the agricultural seed industry. Eur. J. Oper. Res. 185(1): 354-377 (2008) - [j16]Samuel Burer, Dieter Vandenbussche:
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2): 259-282 (2008) - 2007
- [j15]Samuel Burer, Jon Lee:
Solving maximum-entropy sampling problems using factored masks. Math. Program. 109(2-3): 263-281 (2007) - [j14]Miguel F. Anjos, Samuel Burer:
On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization. SIAM J. Optim. 18(4): 1310-1325 (2007) - 2006
- [j13]Yi Zhang, Samuel Burer, W. Nick Street:
Ensemble Pruning Via Semi-definite Programming. J. Mach. Learn. Res. 7: 1315-1338 (2006) - [j12]Samuel Burer, Changhui Choi:
Computational enhancements in low-rank semidefinite programming. Optim. Methods Softw. 21(3): 493-512 (2006) - [j11]Samuel Burer, Dieter Vandenbussche:
Solving Lift-and-Project Relaxations of Binary Integer Programs. SIAM J. Optim. 16(3): 726-750 (2006) - 2005
- [j10]Kurt M. Anstreicher, Samuel Burer:
D.C. Versus Copositive Bounds for Standard QP. J. Glob. Optim. 33(2): 299-312 (2005) - [j9]Samuel Burer, Renato D. C. Monteiro:
Local Minima and Convergence in Low-Rank Semidefinite Programming. Math. Program. 103(3): 427-444 (2005) - [c1]Yi Zhang, W. Nick Street, Samuel Burer:
Sharing Classifiers among Ensembles from Related Problem Domains. ICDM 2005: 522-529 - 2003
- [j8]Samuel Burer, Renato D. C. Monteiro:
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2): 329-357 (2003) - [j7]Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. Math. Program. 95(2): 359-379 (2003) - [j6]Samuel Burer, Renato D. C. Monteiro:
A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming. Optim. Methods Softw. 18(1): 1-38 (2003) - [j5]Samuel Burer:
Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices. SIAM J. Optim. 14(1): 139-172 (2003) - 2002
- [j4]Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. Comput. Optim. Appl. 22(1): 49-79 (2002) - [j3]Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
Solving a class of semidefinite programs via nonlinear programming. Math. Program. 93(1): 97-122 (2002) - [j2]Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
Maximum stable set formulations and heuristics based on continuous optimization. Math. Program. 94(1): 137-166 (2002) - [j1]Samuel Burer, Renato D. C. Monteiro, Yin Zhang:
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. SIAM J. Optim. 12(2): 503-521 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
