An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems

Einosuke Iida, Makoto Yamashita

An arc-search interior-point method is a type of interior-point methods that approximates the central path by an ellipsoidal arc, and it can often reduce the number of iterations.…