| 2014 | Faster, but weaker, relaxations for quadratically constrained quadratic programs | 김선영 | Article |
| 2017 | Formalizing the meta-theory of first-order predicate logic | 김선영 | Article |
| 2005 | Generalized lagrangian duals and sums of squares relaxations of sparse polynomial optimization blems | 김선영 | Article |
| 2018 | LAGRANGIAN-CONIC RELAXATIONS, PART I: A UNIFIED FRAMEWORK AND ITS APPLICATIONS TO QUADRATIC OPTIMIZATION PROBLEMS | 김선영 | Article |
| 2019 | LAGRANGIAN-CONIC RELAXATIONS, PART II: APPLICATIONS TO POLYNOMIAL OPTIMIZATION PROBLEMS | 김선영 | Article |
| 2020 | Non-commutative groupoids obtained from the failure of 3-uniqueness in stable theories | 김선영 | Article |
| 1999 | Numerical solutions of Cauchy singular integral equations using generalized inverses | 김선영 | Article |
| 2004 | Numerical stability of path tracing in polyhedral homotopy continuation methods | 김선영 | Article |
| 2019 | On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems | 김선영 | 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 |
| 2016 | Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets | 김선영 | Article |
| 2010 | Semidefinite programming relaxations for sensor network localization | 김선영 | Conference Paper |
| 2014 | SIMPLIFIED COPOSITIVE AND LAGRANGIAN RELAXATIONS FOR LINEARLY CONSTRAINED QUADRATIC OPTIMIZATION PROBLEMS IN CONTINUOUS AND BINARY VARIABLES | 김선영 | Article |
| 2010 | Solving polynomial least squares problems via semidefinite programming relaxations | 김선영 | Article |
| 2019 | Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods | 김선영 | Article |
| 1998 | Solving singular integral equations using Gaussian quadrature and overdetermined system | 김선영 | Article |
| 2008 | Sparse second order cone programming formulations for convex optimization problems | 김선영 | Article |
| 2005 | Sparsity in sums of squares of polynomials | 김선영 | Article |
| 2023 | Strong duality of a conic optimization problem with a single hyperplane and two cone constraints | 김선영 | Article |
| 2007 | Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity | 김선영 | Article |
| 1995 | The convergence of quasi-Gauss-Newton methods for nonlinear problems | 김선영 | Article |
