Browsing by Author 김선영

Jump to:
All A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
  • Sort by:
  • In order:
  • Results/Page
  • Authors/Record:

Showing results 1 to 30 of 95

Issue DateTitleAuthor(s)Type
2013A CONTINUATION METHOD FOR LARGE-SIZED SENSOR NETWORK LOCALIZATION PROBLEMS김선영Article
1999A convergence criterion for Secant method with approximate zeros김선영Article
2003A general framework for convex relaxation of polynomial optimization problems over cones김선영Article
2016A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems김선영Article
2002A newton-based approach for attributing tumor lethality in animal carcinogenicity studies김선영Article
2013A quadratically constrained quadratic optimization model for completely positive cone programming김선영Article
2017A robust Lagrangian-DNN method for a class of quadratic optimization problems김선영Article
2007A study of Wetland Vegetation and Microbial Communities under Elevated CO₂, Warming, and Drought김선영Doctoral Thesis
2008Algorithm 883: SparsePOP - A sparse semidefinite programming relaxation of polynomial optimization problems김선영Article
2012Algorithm 920: SFSDP: A sparse version of full semidefinite programming relaxation for sensor network localization problems김선영Article
2009An Assessment of Volatility Transmission of Stock Index Futures Returns강재란Master's Thesis
2017Binary quadratic optimization problems that are difficult to solve by conic relaxations김선영Article
1996Computational techniques for inverse problems in kidney modeling김선영Article
2003Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods김선영Article
2018Convexification of a Nonconvex Quadratic by a Second Order Cone and a Nonconvex Quadratic김설인Master's Thesis
2008Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP김선영Article
2017EXACT SEMIDEFINITE PROGRAMMING RELAXATIONS WITH TRUNCATED MOMENT MATRIX FOR BINARY POLYNOMIAL OPTIMIZATION PROBLEMS김선영Article
2003Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations김선영Article
2011Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion김선영Article
2009Exploiting sparsity in SDP relaxation for sensor network localization김선영Article
2012Exploiting sparsity in SDP relaxation of polynomial optimization problems김선영Book Chapter
2016Exploiting Sparsity of Bounded Sums of Squares Hierarchy for Polynomial Optimization이민지Master's Thesis
2016Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization김선영Article
2014Faster, but weaker, relaxations for quadratically constrained quadratic programs김선영Article
2017FORMALIZING THE META -THEORY OF FIRST-ORDER PREDICATE LOGIC김선영Article
2005Generalized lagrangian duals and sums of squares relaxations of sparse polynomial optimization blems김선영Article
2015Least-Squares Monte Carlo method for the valuation of American Options김다정Master's Thesis
1993Mobius band의 조형적 표현 연구김선영Master's Thesis
2010Numerical Experiments for Nuclear Norm Minimization Problems김남희Master's Thesis
2010Numerical Experiments with ESDP and SFSDP for 3-Dimensional Anchor-free ProblemsKim, Janet SMaster's Thesis

BROWSE