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

An arc-search interior-point method is a type of interior-point method that approximates the central path by an ellipsoidal arc, and it can often reduce the number of iterations. In this work, to further reduce the number of iterations and the computation time for solving linear programming problems, we propose two arc-search interior-point methods using Nesterovâ€™s … Read more