Samuel Burer
Samuel Burer
Professor of Business Analytics, University of Iowa
Bestätigte E-Mail-Adresse bei uiowa.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S Burer, RDC Monteiro
Mathematical Programming 95 (2), 329-357, 2003
7322003
Non-convex mixed-integer nonlinear programming: A survey
S Burer, AN Letchford
Surveys in Operations Research and Management Science 17 (2), 97-106, 2012
4082012
On the copositive representation of binary and continuous nonconvex quadratic programs
S Burer
Mathematical Programming 120 (2), 479-495, 2009
3792009
Local minima and convergence in low-rank semidefinite programming
S Burer, RDC Monteiro
Mathematical Programming 103 (3), 427-444, 2005
3492005
Ensemble pruning via semi-definite programming
Y Zhang, S Burer, WN Street
Journal of machine learning research 7 (Jul), 1315-1338, 2006
3152006
Rank-two relaxation heuristics for max-cut and other binary quadratic programs
S Burer, RDC Monteiro, Y Zhang
SIAM Journal on Optimization 12 (2), 503-521, 2002
2012002
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
S Burer, D Vandenbussche
Mathematical Programming 113 (2), 259-282, 2008
1432008
Copositive programming
S Burer
Handbook on semidefinite, conic and polynomial optimization, 201-218, 2012
1102012
Computable representations for convex hulls of low-dimensional quadratic forms
KM Anstreicher, S Burer
Mathematical programming 124 (1-2), 33-43, 2010
1102010
Solving lift-and-project relaxations of binary integer programs
S Burer, D Vandenbussche
SIAM Journal on Optimization 16 (3), 726-750, 2006
1062006
A projected gradient algorithm for solving the maxcut SDP relaxation
S Burer, RDC Monteiro
Optimization Methods and Software 15 (3-4), 175-200, 2001
104*2001
Globally Solving Nonconvex Quadratic Programming Problems via Completely Positive Programming
J Chen, S Burer
1022011
Solving a class of semidefinite programs via nonlinear programming
S Burer, RDC Monteiro, Y Zhang
Mathematical Programming 93 (1), 97-122, 2002
95*2002
Second-order-cone constraints for extended trust-region subproblems
S Burer, KM Anstreicher
SIAM Journal on Optimization 23 (1), 432-451, 2013
942013
Coordinating the supply chain in the agricultural seed industry
S Burer, PC Jones, TJ Lowe
European Journal of Operational Research 185 (1), 354-377, 2008
942008
On non-convex quadratic programming with box constraints
S Burer, AN Letchford
SIAM Journal on Optimization 20 (2), 1073-1089, 2009
912009
The MILP road to MIQCP
S Burer, A Saxena
Mixed integer nonlinear programming, 373-405, 2012
87*2012
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
S Burer, D Vandenbussche
Computational Optimization and Applications 43 (2), 181-195, 2009
732009
Optimizing a polyhedral-semidefinite relaxation of completely positive programs
S Burer
Mathematical Programming Computation 2 (1), 1-19, 2010
722010
The trust region subproblem with non-intersecting linear constraints
S Burer, B Yang
Mathematical Programming 149 (1-2), 253-264, 2015
592015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20