4 citations · 5 across the 3 of their papers we have counts for
3 papers
math.GT2017
Quasi-trivial Quandles and Biquandles, Cocycle Enhancements and Link-Homotopy of Pretzel links
Mohamed Elhamdadi, Minghui Liu, Sam Nelson
We investigate some algebraic structures called quasi-trivial quandles and we use them to study link-homotopy of pretzel links. Precisely, a necessary and sufficient condition for…
math.OC2015★ 4 cited
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
Minghui Liu, Gabor Pataki
In conic linear programming -- in contrast to linear programming -- the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality…
math.OC2014★ 1 cited
Exact duality in semidefinite programming based on elementary reformulations
Minghui Liu, Gabor Pataki
In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP b…