| Maximum-entropy sampling and the Boolean quadric polytope. | 0 | 0.34 | 2018 |
| Quadratic programs with hollows. | 1 | 0.36 | 2018 |
| Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem. | 1 | 0.35 | 2017 |
| Separating doubly nonnegative and completely positive matrices. | 10 | 0.54 | 2013 |
| Second-Order-Cone Constraints for Extended Trust-Region Subproblems. | 28 | 1.10 | 2013 |
| Geometric conditions for Euclidean Steiner trees in ℜd. | 0 | 0.34 | 2013 |
| On convex relaxations for quadratically constrained quadratic programming. | 27 | 0.98 | 2012 |
| Computable representations for convex hulls of low-dimensional quadratic forms | 42 | 1.80 | 2010 |
| Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming | 88 | 2.91 | 2009 |
| Two “well-known” properties of subgradient optimization | 26 | 1.14 | 2009 |
| Continuous optimization: 5th Brazilian workshop | 0 | 0.34 | 2008 |
| An improved algorithm for computing Steiner minimal trees in Euclidean d-space | 8 | 0.65 | 2008 |
| D.C. Versus Copositive Bounds for Standard QP | 16 | 0.90 | 2005 |
| The Thirteen Spheres: A New Proof | 7 | 1.96 | 2004 |
| The volumetric barrier for convex quadratic constraints | 1 | 0.38 | 2004 |
| Recent advances in the solution of quadratic assignment problems | 57 | 2.62 | 2003 |
| Improved Linear Programming Bounds for Antipodal Spherical Codes | 2 | 1.04 | 2002 |
| Improved Complexity for Maximum Volume Inscribed Ellipsoids | 6 | 1.71 | 2002 |
| A new bound for the quadratic assignment problem based on convex quadratic programming | 29 | 4.81 | 2001 |
| Maximum-entropy remote sampling | 5 | 0.83 | 2001 |
| A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite | 11 | 1.48 | 2000 |
| The Volumetric Barrier for Semidefinite Programming | 5 | 0.50 | 2000 |
| On Lagrangian Relaxation of Quadratic Matrix Constraints | 51 | 6.93 | 2000 |
| Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. | 8 | 0.95 | 1999 |
| Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming | 10 | 0.84 | 1999 |
| Towards a Practical Volumetric Cutting Plane Method for Convex Programming | 11 | 0.77 | 1998 |
| On Vaidya's volumetric cutting plane method for convex programming | 11 | 1.12 | 1997 |
| On Long Step Path Following and SUMT for Linear and Quadratic Programming | 3 | 0.47 | 1996 |
| Volumetric path following algorithms for linear programming | 4 | 0.55 | 1996 |
| Continuous Relaxations for Constrained Maximum-Entropy Sampling | 5 | 1.01 | 1996 |
| Large step volumetric potential reduction algorithms for linear programming | 6 | 0.67 | 1996 |
| A New Infinity-Norm Path Following Algorithm for Linear Programming | 14 | 1.10 | 1995 |
| A Monotonic Build-Up Simplex Algorithm for Linear Programming | 9 | 0.76 | 1994 |
| On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise | 3 | 0.51 | 1993 |
| Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming | 1 | 0.35 | 1993 |
| On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP | 0 | 0.34 | 1993 |
| A Long-Step Barrier Method for Convex Quadratic Programming. | 12 | 3.18 | 1993 |
| A family of search directions for Karmarkar's algorithm | 5 | 0.61 | 1993 |
| On interior algorithms for linear programming with no regularity assumptions | 3 | 0.56 | 1992 |
| Long steps in an O(n3L) algorithm for linear programming | 13 | 2.57 | 1992 |
| Crashing a maximum-weight complementary basis | 2 | 0.56 | 1992 |
| On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations | 8 | 0.85 | 1991 |
| A combined phase I-phase II scaled potential algorithm for linear programming | 6 | 3.88 | 1991 |
| The worst-casr step in Karmarkar's algorithm | 7 | 1.44 | 1989 |
| A combined phase I-phase II projective algorithm for linear programming | 16 | 4.37 | 1989 |
| Linear programming and the newton barrier flow. | 6 | 0.79 | 1988 |
| A Monotonic Projective Algorithm for Fractional Linear Programming | 49 | 24.15 | 1986 |
