Sunyoung Kim

From MaRDI portal
Revision as of 15:04, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:236374

Available identifiers

zbMath Open kim.sunyoungMaRDI QIDQ236374

List of research outcomes





PublicationDate of PublicationType
Further development in convex conic reformulation of geometric nonconvex conic optimization problems2024-10-22Paper
Exact Matrix Completion via High-Rank Matrices in Sum-of-Squares Relaxations2023-11-24Paper
Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems2023-08-10Paper
Exact SDP relaxations for quadratic programs with bipartite graph structures2023-07-13Paper
Equivalent Sufficient Conditions for Global Optimality of Quadratically Constrained Quadratic Program2023-03-10Paper
The Largest Unsolved QAP Instance Tai256c Can Be Converted into A 256-dimensional Simple BQOP with A Single Cardinality Constraint2022-10-28Paper
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints2022-06-14Paper
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures2022-03-15Paper
Strong duality of a conic optimization problem with a single hyperplane and two cone constraints2021-11-05Paper
Generating Cutting Inequalities Successively for Quadratic Optimization Problems in Binary Variables2021-07-19Paper
A Newton-bracketing method for a simple conic optimization problem2021-07-06Paper
https://portal.mardi4nfdi.de/entity/Q49636682021-02-19Paper
https://portal.mardi4nfdi.de/entity/Q51483582021-02-03Paper
Solving Challenging Large Scale QAPs2021-01-23Paper
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures2020-05-26Paper
A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems2020-05-20Paper
Algorithm 9962020-04-24Paper
A dual spectral projected gradient method for log-determinant semidefinite problems2020-04-07Paper
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods2019-12-03Paper
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems2019-11-22Paper
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems2018-12-27Paper
Binary quadratic optimization problems that are difficult to solve by conic relaxations2018-05-24Paper
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems2017-05-30Paper
Algorithm 9202017-05-19Paper
A robust Lagrangian-DNN method for a class of quadratic optimization problems2017-04-21Paper
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets2016-05-25Paper
Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization2016-05-17Paper
Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems2016-04-26Paper
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems2016-04-04Paper
https://portal.mardi4nfdi.de/entity/Q29284092014-11-07Paper
Faster, but weaker, relaxations for quadratically constrained quadratic programs2014-09-18Paper
A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming2014-04-09Paper
https://portal.mardi4nfdi.de/entity/Q49088532013-03-07Paper
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion2011-09-27Paper
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization2010-03-17Paper
Solving polynomial least squares problems via semidefinite programming relaxations2010-01-25Paper
Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP2009-06-17Paper
Recognizing underlying sparsity in optimization2009-04-24Paper
SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS2009-01-28Paper
PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems2007-09-06Paper
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity2006-05-30Paper
Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems2005-09-16Paper
Sparsity in sums of squares of polynomials2005-05-12Paper
Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint2005-03-07Paper
Numerical stability of path tracing in polyhedral homotopy continuation methods2005-02-23Paper
PHoM -- a polyhedral homotopy continuation method for polynomial systems2005-02-11Paper
A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES2004-03-22Paper
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions2003-12-04Paper
Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods2003-05-19Paper
https://portal.mardi4nfdi.de/entity/Q47904602003-05-12Paper
https://portal.mardi4nfdi.de/entity/Q47904612003-01-28Paper
Solving singular integral equations using Gaussian quadrature and overdetermined system2002-08-06Paper
A Newton-based approach for attributing tumor lethality in animal carcinogenicity studies.2002-03-03Paper
Second order cone programming relaxation of nonconvex quadratic optimization problems2002-02-07Paper
https://portal.mardi4nfdi.de/entity/Q47188352000-06-25Paper
https://portal.mardi4nfdi.de/entity/Q49547712000-06-12Paper
https://portal.mardi4nfdi.de/entity/Q49549752000-06-12Paper
Numerical solutions of Cauchy singular integral equations using generalized inverses2000-01-20Paper
https://portal.mardi4nfdi.de/entity/Q31251261997-05-06Paper
Computational techniques for inverse problems in kidney modeling1996-11-12Paper
The convergence of quasi-Gauss-Newton methods for nonlinear problems1995-07-26Paper
A quasi-Newton method for solving nonlinear algebraic equations1993-04-01Paper
Using quasi-Newton methods for kidney modeling equations1990-01-01Paper
An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256cN/APaper

Research outcomes over time

This page was built for person: Sunyoung Kim