3 papers
math.OC2024
An inexact infeasible arc-search interior-point method for linear optimization problems
Einosuke Iida, Makoto Yamashita
We propose an inexact infeasible arc-search interior-point method for solving linear optimization problems. The method combines an arc-search strategy with inexact solutions to New…
math.OC2023
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.…
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…