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 |