| Exact Semidefinite Formulations For A Class Of (Random And Non-Random) Nonconvex Quadratic Programs (Vol 181, Pg 1, 2020) | 0 | 0.34 | 2021 |
| Convex Hull Representations For Bounded Products Of Variables | 1 | 0.35 | 2021 |
| Quadratic Optimization With Switching Variables: The Convex Hull For N=2 | 0 | 0.34 | 2021 |
| Three methods for robust grading. | 0 | 0.34 | 2019 |
| A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming. | 1 | 0.35 | 2018 |
| A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. | 1 | 0.35 | 2018 |
| Quadratic programs with hollows. | 1 | 0.36 | 2018 |
| A branch-and-bound algorithm for instrumental variable quantile regression. | 0 | 0.34 | 2017 |
| How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic | 6 | 0.44 | 2017 |
| Robust sensitivity analysis of the optimal value of linear programming | 1 | 0.37 | 2017 |
| A Two-Variable Approach to the Two-Trust-Region Subproblem. | 4 | 0.40 | 2016 |
| The trust region subproblem with non-intersecting linear constraints | 6 | 0.49 | 2015 |
| A gentle, geometric introduction to copositive optimization | 5 | 0.42 | 2015 |
| Unbounded convex sets for non-convex mixed-integer quadratic programming. | 4 | 0.41 | 2014 |
| Second-Order-Cone Constraints for Extended Trust-Region Subproblems. | 28 | 1.10 | 2013 |
| Separation and relaxation for cones of quadratic forms. | 7 | 0.52 | 2013 |
| Globally solving nonconvex quadratic programming problems via completely positive programming. | 30 | 0.91 | 2012 |
| Representing quadratically constrained quadratic programs as generalized copositive programs. | 19 | 0.79 | 2012 |
| Relaxing the optimality conditions of box QP | 3 | 0.38 | 2011 |
| Optimizing a polyhedral-semidefinite relaxation of completely positive programs | 28 | 1.24 | 2010 |
| Computable representations for convex hulls of low-dimensional quadratic forms | 42 | 1.80 | 2010 |
| Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound | 27 | 1.45 | 2009 |
| A p-cone sequential relaxation procedure for 0-1 integer programs | 3 | 0.56 | 2009 |
| On the copositive representation of binary and continuous nonconvex quadratic programs | 132 | 5.58 | 2009 |
| On Nonconvex Quadratic Programming with Box Constraints | 1 | 0.35 | 2009 |
| A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations | 54 | 2.43 | 2008 |
| Coordinating the supply chain in the agricultural seed industry | 11 | 0.71 | 2008 |
| On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization | 5 | 0.43 | 2007 |
| Solving maximum-entropy sampling problems using factored masks | 7 | 0.60 | 2007 |
| Computational enhancements in low-rank semidefinite programming | 15 | 1.34 | 2006 |
| Solving Lift-and-Project Relaxations of Binary Integer Programs | 40 | 2.59 | 2006 |
| Ensemble Pruning Via Semi-definite Programming | 136 | 3.82 | 2006 |
| Local Minima and Convergence in Low-Rank Semidefinite Programming | 100 | 8.02 | 2005 |
| Sharing Classifiers among Ensembles from Related Problem Domains | 3 | 0.41 | 2005 |
| D.C. Versus Copositive Bounds for Standard QP | 16 | 0.90 | 2005 |
| A GENERAL FRAMEWORK FOR ESTABLISHING POLYNOMIAL CONVERGENCE OF LONG-STEP METHODS FOR SEMIDEFINITE PROGRAMMING | 2 | 0.40 | 2003 |
| A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. | 249 | 17.07 | 2003 |
| A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs | 21 | 1.98 | 2003 |
| Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices | 18 | 1.30 | 2003 |
| Maximum stable set formulations and heuristics based on continuous optimization. | 27 | 2.19 | 2002 |
| Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs | 71 | 3.29 | 2002 |
| Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation | 4 | 1.09 | 2002 |
| Solving a class of semidefinite programs via nonlinear programming | 19 | 4.51 | 2002 |
