| 2003 | A general framework for convex relaxation of polynomial optimization problems over cones | 김선영 | Article |
| 2016 | A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems | 김선영 | Article |
| 2013 | A quadratically constrained quadratic optimization model for completely positive cone programming | 김선영 | Article |
| 2008 | Algorithm 883: SparsePOP - A sparse semidefinite programming relaxation of polynomial optimization problems | 김선영 | Article |
| 2012 | Algorithm 920: SFSDP: A sparse version of full semidefinite programming relaxation for sensor network localization problems | 김선영 | Article |
| 2003 | Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods | 김선영 | Article |
| 2008 | Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP | 김선영 | Article |
| 2022 | Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints | 김선영 | Article |
| 2003 | Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations | 김선영 | Article |
| 2011 | Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion | 김선영 | Article |
| 2009 | Exploiting sparsity in SDP relaxation for sensor network localization | 김선영 | Article |
| 2012 | Exploiting sparsity in SDP relaxation of polynomial optimization problems | 김선영 | Book Chapter |
| 2014 | Faster, but weaker, relaxations for quadratically constrained quadratic programs | 김선영 | Article |
| 2005 | Generalized lagrangian duals and sums of squares relaxations of sparse polynomial optimization blems | 김선영 | Article |
| 2004 | Numerical stability of path tracing in polyhedral homotopy continuation methods | 김선영 | Article |
| 2004 | PHoM - A polyhedral homotopy continuation method for polynomial systems | 김선영 | Article |
| 2006 | PHoMpara - Parallel implementation of the polyhedral homotopy continuation method for polynomial systems | 김선영 | Article |
| 2009 | Recognizing underlying sparsity in optimization | 김선영 | Article |
| 2003 | Second order cone programming relaxation of a positive semidefinite constraint | 김선영 | Article |
| 2001 | Second order cone programming relaxation of nonconvex quadratic optimization problems | 김선영 | Article |
| 2010 | Semidefinite programming relaxations for sensor network localization | 김선영 | Conference Paper |
| 2010 | Solving polynomial least squares problems via semidefinite programming relaxations | 김선영 | Article |
| 2008 | Sparse second order cone programming formulations for convex optimization problems | 김선영 | Article |
| 2005 | Sparsity in sums of squares of polynomials | 김선영 | Article |
| 2007 | Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity | 김선영 | Article |
