| Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints | 0 | 0.34 | 2022 |
| A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems | 0 | 0.34 | 2020 |
| Algorithm 996: BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints. | 0 | 0.34 | 2019 |
| Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems. | 0 | 0.34 | 2018 |
| A robust Lagrangian-DNN method for a class of quadratic optimization problems. | 2 | 0.37 | 2017 |
| Binary quadratic optimization problems that are difficult to solve by conic relaxations. | 1 | 0.35 | 2017 |
| Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization. | 2 | 0.37 | 2016 |
| A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. | 15 | 0.62 | 2016 |
| Faster, but weaker, relaxations for quadratically constrained quadratic programs | 4 | 0.41 | 2014 |
| Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization. | 0 | 0.34 | 2013 |
| A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming. | 11 | 0.55 | 2013 |
| Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems | 11 | 0.61 | 2012 |
| Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion | 24 | 0.85 | 2011 |
| Solving polynomial least squares problems via semidefinite programming relaxations | 2 | 0.41 | 2010 |
| Semidefinite programming relaxations for sensor network localization | 0 | 0.34 | 2010 |
| Exploiting structured sparsity in large scale semidefinite programming problems | 1 | 0.35 | 2010 |
| Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems | 2 | 0.37 | 2010 |
| Recognizing underlying sparsity in optimization | 6 | 0.47 | 2009 |
| A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones | 16 | 0.88 | 2009 |
| Exploiting Sparsity in SDP Relaxation for Sensor Network Localization | 39 | 1.36 | 2009 |
| Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems | 62 | 4.00 | 2008 |
| A conversion of an SDP having free variables into the standard form SDP | 3 | 0.47 | 2007 |
| Dynamic Enumeration of All Mixed Cells | 13 | 1.02 | 2007 |
| An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones | 14 | 1.83 | 2007 |
| A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion | 11 | 1.66 | 2006 |
| A 146-mm/sup 2/ 8-gb multi-level NAND flash memory with 70-nm CMOS technology | 9 | 2.72 | 2006 |
| Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity | 149 | 7.10 | 2006 |
| Sparsity in sums of squares of polynomials | 40 | 3.79 | 2005 |
| Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems | 24 | 2.45 | 2005 |
| PHoM – a Polyhedral Homotopy Continuation Method for Polynomial Systems | 24 | 1.55 | 2004 |
| High Performance Grid and Cluster Computing for Some Optimization Problems | 0 | 0.34 | 2004 |
| Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results | 32 | 3.07 | 2003 |
| Implementation and evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0) | 49 | 3.50 | 2003 |
| Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations | 24 | 2.17 | 2003 |
| Second order cone programming relaxation of a positive semidefinite constraint | 7 | 1.01 | 2003 |
| On the finite convergence of successive SDP relaxation methods | 8 | 0.84 | 2002 |
| Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems | 2 | 0.41 | 2002 |
| Lagrangian Dual Interior-Point Methods for Semidefinite Programs | 7 | 0.77 | 2002 |
| Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method | 28 | 2.56 | 2002 |
| Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems | 4 | 0.56 | 2002 |
| Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework | 103 | 9.70 | 2001 |
| Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets | 2 | 0.54 | 2001 |
| Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem | 38 | 3.23 | 2001 |
| Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization | 9 | 1.27 | 2000 |
| Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets | 35 | 5.81 | 2000 |
| A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction | 28 | 2.15 | 1999 |
| Search directions in the SDP and the monotone SDLCP: generalization and inexact computation | 13 | 1.90 | 1999 |
| Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs | 53 | 4.91 | 1998 |
| Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP | 12 | 1.07 | 1998 |
| Exploiting sparsity in primal-dual interior-point methods for semidefinite programming | 55 | 7.45 | 1997 |
