2022 | Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints | 김선영 | 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 |
2014 | Faster, but weaker, relaxations for quadratically constrained quadratic programs | 김선영 | Article |
2017 | Formalizing the meta-theory of first-order predicate logic | 김선영 | Article |
2020 | Fully commutative elements of the complex reflection groups | 오세진 | Article |
2005 | Generalized lagrangian duals and sums of squares relaxations of sparse polynomial optimization blems | 김선영 | 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 |
2013 | Pieri algebras for the orthogonal and symplectic groups | 김상집 | Article |
2013 | Quivers, invariants and quotient correspondence | 김상집 | Article |
2009 | Recognizing underlying sparsity in optimization | 김선영 | Article |
2014 | ROW CONVEX TABLEAUX and BOTT-SAMELSON VARIETIES | 김상집 | 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 |
2010 | Semidefinite programming relaxations for sensor network localization | 김선영 | Conference Paper |
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 |
2007 | Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity | 김선영 | Article |