A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem.
Paulo Roberto OliveiraPublished in: Math. Methods Oper. Res. (2014)
Keyphrases
- optimization algorithm
- computational complexity
- detection algorithm
- theoretical analysis
- linear complexity
- np hard
- worst case
- special case
- computational cost
- high accuracy
- preprocessing
- expectation maximization
- recognition algorithm
- convergence rate
- times faster
- optimal solution
- simulated annealing
- learning algorithm
- experimental evaluation
- dynamic programming
- significant improvement
- objective function
- closed form
- search space
- improved algorithm
- reinforcement learning