| 2013 | A CONTINUATION METHOD FOR LARGE-SIZED SENSOR NETWORK LOCALIZATION PROBLEMS | 김선영 | Article |
| 1999 | A convergence criterion for Secant method with approximate zeros | 김선영 | Article |
| 2020 | A dual spectral projected gradient method for log-determinant semidefinite problems | 김선영 | Article |
| 2003 | A general framework for convex relaxation of polynomial optimization problems over cones | 김선영 | Article |
| 2020 | A GEOMETRICAL ANALYSIS ON CONVEX CONIC REFORMULATIONS OF QUADRATIC AND POLYNOMIAL OPTIMIZATION PROBLEMS | 김선영 | Article |
| 2016 | A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems | 김선영 | Article |
| 2002 | A newton-based approach for attributing tumor lethality in animal carcinogenicity studies | 김선영 | Article |
| 2021 | A Newton-bracketing method for a simple conic optimization problem | 김선영 | Article |
| 2013 | A quadratically constrained quadratic optimization model for completely positive cone programming | 김선영 | Article |
| 2017 | A robust Lagrangian-DNN method for a class of quadratic optimization problems | 김선영 | 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 |
| 2019 | Algorithm 996: BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints | 김선영 | Article |
| 2017 | Binary quadratic optimization problems that are difficult to solve by conic relaxations | 김선영 | Article |
| 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 |
