47 citations · 276 across the 21 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.OC2019★ 1 cited
A double-pivot simplex algorithm and its upper bounds of the iteration numbers
Yaguang Yang
In this paper, a double-pivot simplex method is proposed. Two upper bounds of iteration numbers are derived. Applying one of the bounds to some special linear programming (LP) prob…
math.OC2019★ 3 cited
A Facet Enumeration Algorithm for Convex Polytopes
Yaguang Yang
This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. So…
math.OC2019
An Infeasible Interior-point Arc-search Algorithm for Nonlinear Constrained Optimization
Einosuke Iida, Yaguang Yang, Makoto Yamashita
In this paper, we propose an infeasible arc-search interior-point algorithm for solving nonlinear programming problems. Most algorithms based on interior-point methods are categori…