| 2013 | A CONTINUATION METHOD FOR LARGE-SIZED SENSOR NETWORK LOCALIZATION PROBLEMS | 김선영 | Article |
| 2020 | A dual spectral projected gradient method for log-determinant semidefinite problems | 김선영 | Article |
| 2020 | A GEOMETRICAL ANALYSIS ON CONVEX CONIC REFORMULATIONS OF QUADRATIC AND POLYNOMIAL OPTIMIZATION PROBLEMS | 김선영 | Article |
| 2021 | A Newton-bracketing method for a simple conic optimization problem | 김선영 | Article |
| 2017 | A robust Lagrangian-DNN method for a class of quadratic optimization 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 |
| 2020 | Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures | 김선영 | Article |
| 2016 | Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization | 김선영 | 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 |
| 2014 | SIMPLIFIED COPOSITIVE AND LAGRANGIAN RELAXATIONS FOR LINEARLY CONSTRAINED QUADRATIC OPTIMIZATION PROBLEMS IN CONTINUOUS AND BINARY VARIABLES | 김선영 | Article |
| 2023 | Strong duality of a conic optimization problem with a single hyperplane and two cone constraints | 김선영 | Article |
