| 1996 | Computational techniques for inverse problems in kidney modeling | 김선영 | 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 |
| 2020 | Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures | 김선영 | Article |
| 2022 | Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints | 김선영 | Article |
| 2018 | Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems | 김선영 | Article |
| 2023 | Exact SDP relaxations for quadratic programs with bipartite graph structures | 김선영 | Article |
| 2022 | Exact SDP relaxations of quadratically constrained quadratic programs with forest structures | 김선영 | Article |
| 2017 | Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems | 김선영 | 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 |
| 2016 | Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization | 김선영 | Article |
| 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 |
