The following pages link to Sunyoung Kim (Q236374):
Displaying 37 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- (Q920582) (redirect page) (← links)
- Using quasi-Newton methods for kidney modeling equations (Q920583) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- A quasi-Newton method for solving nonlinear algebraic equations (Q1205908) (← links)
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions (Q1415482) (← links)
- Solving singular integral equations using Gaussian quadrature and overdetermined system (Q1608400) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- PHoM -- a polyhedral homotopy continuation method for polynomial systems (Q1763006) (← links)
- Numerical stability of path tracing in polyhedral homotopy continuation methods (Q1764148) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods (Q1872931) (← links)
- The convergence of quasi-Gauss-Newton methods for nonlinear problems (Q1894950) (← links)
- Computational techniques for inverse problems in kidney modeling (Q1921195) (← links)
- Numerical solutions of Cauchy singular integral equations using generalized inverses (Q1963117) (← links)
- A dual spectral projected gradient method for log-determinant semidefinite problems (Q1986103) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems (Q2642945) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
- (Q2928409) (← links)
- Algorithm 920 (Q2989170) (← links)
- (Q3125126) (← links)
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS (Q5505738) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)
