3 citations · 4 across the 5 of their papers we have counts for
6 papers
Projection, Degeneracy, and Singularity Degree for Spectrahedra
Haesol Im, Woosuk L. Jung, David Torregrosa-Belén +1
Facial reduction, FR, is a regularization technique for convex programs where the strict feasibility constraint qualification, CQ, fails.Though this CQ holds generically, failure i…
Implicit Redundancy and Degeneracy in Conic Program
Haesol Im
This paper examines the feasible region of a standard conic program represented as the intersection of a closed convex cone and a set of linear equalities. It is recently shown tha…
Revisiting Degeneracy, Strict Feasibility, Stability, in Linear Programming
Jiyoung Im, Henry Wolkowicz
Currently, the simplex method and the interior point method are indisputably the most popular algorithms for solving linear programs, LPs. Unlike general conic programs, LPs with a…
A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem
Hao Hu, Haesol Im, Xinxin Li +1
We study a semismooth Newton-type method for the nearest doubly stochastic matrix problem where both differentiability and nonsingularity of the Jacobian can fail. The optimality c…
A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem
Forbes Burkowski, Jiyoung Im, Henry Wolkowicz
We formulate a doubly nonnegative (DNN) relaxation of the protein side-chain positioning (SCP) problem. We inherit the natural splitting of variables that stems from the facial red…
A Restricted Dual Peaceman-Rachford Splitting Method for QAP
Naomi Graham, Hao Hu, Haesol Im +2
We revisit and strengthen splitting methods for solving doubly nonnegative, DNN, relaxations of the quadratic assignment problem, QAP. We use a modified restricted contractive spli…