An inexact infeasible arc-search interior-point method for linear programming problems.
Einosuke IidaMakoto YamashitaPublished in: CoRR (2024)
Keyphrases
- linear programming problems
- interior point methods
- primal dual
- linear programming
- linear program
- convex optimization
- search space
- semidefinite programming
- search algorithm
- mixed integer
- multiple objectives
- solving problems
- optimal solution
- quadratic programming
- column generation
- convergence rate
- computationally intensive
- simplex method
- special case
- approximation algorithms
- objective function
- multi objective
- genetic algorithm
- natural images
- optimization problems
- state space