47 citations · 276 across the 21 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022★ 6 cited
A polynomial time infeasible interior-point arc-search algorithm for convex optimization
Yaguang Yang
This paper proposes an infeasible interior-point algorithm for the convex optimization problem using arc-search techniques. The proposed algorithm simultaneously selects the center…
math.OC2022
On the facet pivot simplex method for linear programming II: a linear iteration bound
Yaguang Yang
The Hirsch Conjecture stated that any -dimensional polytope with n facets has a diameter at most equal to . This conjecture was disproved by Santos (A counterexample to t…