Sunyoung Kim

发表

Correlative Sparsity in Primal-Dual Interior-Point Methods for LP, SDP, and SOCP

M. Kojima, Kazuhiro Kobayashi, Sunyoung Kim, 2008 .

SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS

M. Kojima, Kazuhiro Kobayashi, Sunyoung Kim, 2008 .

Computing all nonsingular solutions of cyclic- n polynomial using polyhedral homotopy continuation methods

M. Kojima, Sunyoung Kim, Yang Dai, 2003 .

Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets

Sunyoung Kim, V. Jeyakumar, G. M. Lee, 2014 .

Solving singular integral equations using Gaussian quadrature and overdetermined system

Sunyoung Kim, Sunyoung Kim, 1998 .

Solving polynomial least square problems as polynomial semidefinite programs

M. Kojima, Sunyoung Kim, 2008 .

B-411 Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity

M. Kojima, M. Muramatsu, Sunyoung Kim, 2004 .

B-453 User's Manual for SparseCoLO: Conversion Methods for SPARSE COnic-form Linear Optimization Problems

Yoshio Okamoto, Sunyoung Kim, Masakazu Kojima, 2009 .

CMPS m : A C ontinuation M ethod for P olynomial S ystems ( MATLAB version ) — User ’ s Manual

M. Kojima, Sunyoung Kim, 2002 .

CMPS c : A C ontinuation M ethod for P olynomial S ystems ( C + + version )

M. Kojima, Sunyoung Kim, 2002 .

LAGRANGIAN-CONIC RELAXATIONS, PART II: APPLICATIONS TO POLYNOMIAL OPTIMIZATION PROBLEMS

Kim-Chuan Toh, Sunyoung Kim, Masakazu Kojima, 2020 .

A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems

M. Kojima, K. Toh, Sunyoung Kim, 2019, 1901.02179.

SIMPLIFIED COPOSITIVE AND LAGRANGIAN RELAXATIONS FOR LINEARLY CONSTRAINED QUADRATIC OPTIMIZATION PROBLEMS IN CONTINUOUS AND BINARY VARIABLES

M. Kojima, Sunyoung Kim, N. Arima, 2017 .

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim, 2016, Math. Program..

B-475 Lagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems

Kim-Chuan Toh, Sunyoung Kim, Masakazu Kojima, 2014 .

Strong duality of a conic optimization problem with a single hyperplane and two cone constraints

M. Kojima, Sunyoung Kim, 2021, 2111.03251.

Solving Challenging Large Scale QAPs

Kim-Chuan Toh, Sunyoung Kim, Masakazu Kojima, 2021, 2101.09629.

Exact SDP relaxations for quadratic programs with bipartite graph structures

Mituhiro Fukuda, M. Yamashita, Sunyoung Kim, 2022, 2204.09509.

B-447 Exploiting Sparsity in SDP Relaxation for Sensor Network Localization

M. Kojima, Sunyoung Kim, Hayato Waki, 2008 .

Algorithm 996

M. Kojima, K. Toh, Sunyoung Kim, 2018, ACM Trans. Math. Softw..

CORRELATIVE SPARSITY IN SOLVING OPTIMIZATION PROBLEMS

Sunyoung Kim, 2006 .

Recognizing Underlying Sparsity in Optimization B-428 Recognizing Underlying Sparsity in Optimization

P. Toint, M. Kojima, Sunyoung Kim, 2006 .

Sums of Squares Representation of Polynomials by Alternating Directional Augmented Lagrangian Methods with Fast Convergence

Sunyoung Kim, Hikaru Komeiji, Makoto, 2018 .

The Largest Unsolved QAP Instance Tai256c Can Be Converted into A 256-dimensional Simple BQOP with A Single Cardinality Constraint

M. Kojima, H. Mittelmann, Y. Shinano, 2022, 2210.15963.

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

M. Kojima, K. Toh, Sunyoung Kim, 2015, Mathematical Programming.

Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures

M. Kojima, Sunyoung Kim, Kim-Chuan Toh, 2020, Journal of Global Optimization.

Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods

M. Yamashita, Sunyoung Kim, Masaki Kimizuka, 2019, Journal of Global Optimization.

Algorithm 996

Kim-Chuan Toh, Akiko Takeda, Masakazu Kojima, 2018, ACM Trans. Math. Softw..

Research Reports on Mathematical and Computing Sciences Series B : Operations Research

Sunyoung Kim, Masakazu Kojima, Makoto Yamashita, 2003 .

Sums of Squares and Semideﬁnite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity

Masakazu Muramatsu, Masakazu Kojima, Sunyoung Kim, 2004 .

Equivalent Sufficient Conditions for Global Optimality of Quadratically Constrained Quadratic Program

M. Kojima, Sunyoung Kim, 2023, 2303.05874.

A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming

Masakazu Kojima, Sunyoung Kim, Naohiko Arima, 2013, SIAM J. Optim..

Exploiting Sparsity in SDP Relaxation for Sensor Network Localization

Masakazu Kojima, Sunyoung Kim, Hayato Waki, 2009, SIAM J. Optim..

A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones

Sunyoung Kim, Masakazu Kojima, Hayato Waki, 2003 .

Recognizing underlying sparsity in optimization

Masakazu Kojima, Sunyoung Kim, Philippe L. Toint, 2009, Math. Program..

Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

Masakazu Kojima, Sunyoung Kim, M. Kojima, 2003, Comput. Optim. Appl..

Numerical solutions of Cauchy singular integral equations using generalized inverses

Sunyoung Kim, Sunyoung Kim, 1999 .

PHoM – a Polyhedral Homotopy Continuation Method for Polynomial Systems

Akiko Takeda, Masakazu Kojima, Sunyoung Kim, 2004, Computing.

Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint

Masakazu Kojima, Sunyoung Kim, Makoto Yamashita, 2003, Optim. Methods Softw..

A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems

Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh, 2020, SIAM J. Optim..

SIMPLIFIED COPOSITIVE AND LAGRANGIAN RELAXATIONS FOR LINEARLY CONSTRAINED QUADRATIC OPTIMIZATION PROBLEMS IN CONTINUOUS AND BINARY VARIABLES

M. Kojima, Sunyoung Kim, Naohiko Arima, 2017 .

SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems

Masakazu Muramatsu, Masakazu Kojima, Sunyoung Kim, 2005 .

A dual spectral projected gradient method for log-determinant semidefinite problems

Makoto Yamashita, Mituhiro Fukuda, Sunyoung Kim, 2018, Computational Optimization and Applications.

BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints

M. Kojima, K. Toh, Sunyoung Kim, 2018, 1804.00761.

Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion

Masakazu Kojima, Sunyoung Kim, Makoto Yamashita, 2011, Math. Program..

Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems

M. Kojima, Sunyoung Kim, Hayato Waki, 2012, TOMS.

Parallel Implementation of Successive Sparse SDP Relaxations for Large-Scale Euclidean Distance Geometry Problems

Sunyoung Kim, Masakazu Kojima, Makoto Yamashita, 2012 .

Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems

Akiko Takeda, Sunyoung Kim, Naoki Ito, 2017, SIAM J. Optim..

B-471 Extension of Completely Positive Cone Relaxation to Polynomial Optimization

Sunyoung Kim, Masakazu Kojima, Naohiko Arima, 2013 .

CMPSm : A Continuation Method for Polynomial Systems (MATLAB version) — User's Manual

Masakazu Kojima, Sunyoung Kim, M. Kojima, 2002 .

Sparsity in sums of squares of polynomials

Masakazu Kojima, Sunyoung Kim, Hayato Waki, 2005, Math. Program..

Exact SDP relaxations of quadratically constrained quadratic programs with forest structures

Mituhiro Fukuda, M. Yamashita, Sunyoung Kim, 2020, Journal of Global Optimization.

Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

M. Kojima, M. Muramatsu, Sunyoung Kim, 2006, SIAM J. Optim..