28 citations · 62 across the 25 of their papers we have counts for
28 papers
Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
Woosuk L. Jung, Henry Wolkowicz
The so-called \emph{simplified} Wasserstein barycenter problem, also known as the cheapest hub problem, consists in selecting one point from each of given sets, each set consis…
The -Condition Number: Applications to Optimal Preconditioning and Low Rank Generalized Jacobian Updating
Woosuk L. Jung, David Torregrosa-Belén, Henry Wolkowicz
Preconditioning is essential in iterative methods for solving linear systems. It is also the implicit objective in updating approximations of Jacobians in optimization methods, e.g…
Singularity degree of non-facially exposed faces
Fei Wang, Henry Wolkowicz
In this paper, we study the facial structure of the linear image of a cone. We define the singularity degree of a face of a cone to be the minimum number of steps it takes to expos…
Regularized Nonsmooth Newton Algorithms for Best Approximation
Yair Censor, Walaa M. Moursi, Tyler Weames +1
We consider the problem of finding the best approximation point from a polyhedral set, and its applications, in particular to solving large-scale linear programs. The classical pro…
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…