| Error Bounds And Singularity Degree In Semidefinite Programming | 0 | 0.34 | 2021 |
| Parametric Convex Quadratic Relaxation of the Quadratic Knapsac Problem. | 0 | 0.34 | 2020 |
| Noisy Euclidean distance matrix completion with a single missing node. | 0 | 0.34 | 2019 |
| Low-rank matrix completion using nuclear norm minimization and facial reduction. | 1 | 0.39 | 2018 |
| Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration. | 0 | 0.34 | 2017 |
| A note on alternating projections for ill-posed semidefinite feasibility problems. | 0 | 0.34 | 2017 |
| The Many Faces of Degeneracy in Conic Optimization | 3 | 0.40 | 2017 |
| Local nonglobal minima for solving large-scale extended trust-region subproblems. | 5 | 0.43 | 2017 |
| NOISY EUCLIDEAN DISTANCE REALIZATION: ROBUST FACIAL REDUCTION AND THE PARETO FRONTIER | 3 | 0.40 | 2017 |
| An SDP-based Method for the Real Radical Ideal Membership Test | 0 | 0.34 | 2017 |
| Semidefinite facial reduction and rigid cluster elastic network interpolation of protein structures | 0 | 0.34 | 2016 |
| Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem | 1 | 0.35 | 2016 |
| Extreme point inequalities and geometry of the rank sparsity ball. | 3 | 0.40 | 2015 |
| Projection methods for quantum channel construction | 2 | 0.43 | 2015 |
| Facial Reduction and SDP Methods for Systems of Polynomial Equations. | 0 | 0.34 | 2015 |
| Coordinate Shadows of Semidefinite and Euclidean Distance Matrices | 8 | 0.66 | 2015 |
| ADMM for the SDP relaxation of the QAP | 0 | 0.34 | 2015 |
| The generalized trust region subproblem | 17 | 0.83 | 2014 |
| Determining protein structures from NOESY distance constraints by semidefinite programming. | 10 | 0.56 | 2013 |
| Strong duality and minimal representations for cone optimization | 13 | 0.77 | 2012 |
| Protein structure by semidefinite facial reduction | 1 | 0.36 | 2012 |
| A robust algorithm for semidefinite programming | 4 | 0.41 | 2012 |
| On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming | 3 | 0.45 | 2011 |
| Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions | 40 | 1.65 | 2010 |
| Generating and measuring instances of hard semidefinite programs | 5 | 0.45 | 2010 |
| A stable primal---dual approach for linear programming under nondegeneracy assumptions | 5 | 0.44 | 2009 |
| Regularization using a parameterized trust region subproblem | 3 | 0.62 | 2009 |
| A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem | 11 | 0.58 | 2009 |
| Sensor network localization, euclidean distance matrix completions, and graph realization | 29 | 1.15 | 2008 |
| Large scale portfolio optimization with piecewise linear transaction costs | 5 | 0.73 | 2008 |
| Foreword: Special issue on large-scale nonlinear and semidefinite programming. | 0 | 0.34 | 2007 |
| Multi-Stage Investment Decision Under Contingent Demand For Networking Planning | 0 | 0.34 | 2006 |
| Solving semidefinite programs using preconditioned conjugate gradients | 5 | 0.52 | 2004 |
| The trust region subproblem and semidefinite programming | 60 | 3.96 | 2004 |
| Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem | 17 | 1.32 | 2002 |
| Semidefinite programming for discrete optimization and matrix completion problems | 14 | 0.89 | 2002 |
| Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks | 4 | 0.40 | 2002 |
| A note on lack of strong duality for quadratic problems with orthogonal constraints | 2 | 0.39 | 2002 |
| On Lagrangian Relaxation of Quadratic Matrix Constraints | 51 | 6.93 | 2000 |
| Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems | 4 | 0.45 | 1999 |
| Pseudolinear Programming. | 0 | 0.34 | 1999 |
| The Quasi-Cauchy Relation and Diagonal Updating | 5 | 0.96 | 1999 |
| Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming | 70 | 7.29 | 1999 |
| Semidefinite programming relaxations for the graph partitioning problem | 35 | 1.85 | 1999 |
| Semidefinite Programming Relaxations for the Quadratic Assignment Problem | 95 | 11.89 | 1998 |
| An Interior-Point Method for Approximate Positive Semidefinite Completions | 14 | 4.27 | 1998 |
| Strong Duality for Semidefinite Programming | 40 | 5.26 | 1997 |
| A semidefinite framework for trust region subproblems with applications to large scale minimization | 81 | 16.45 | 1997 |
| An Interior-Point Method for Semidefinite Programming | 274 | 37.54 | 1996 |
| A recipe for semidefinite relaxation for (0,1)-quadratic programming: In memory of Svata Poljak | 78 | 9.84 | 1995 |
