Boosting Method in Approximately Solving Linear Programming with Fast Online Algorithm.
Wenzhi GaoChunlin SunYuyang YeYinyu YePublished in: CoRR (2021)
Keyphrases
- linear programming
- dynamic programming
- optimal solution
- experimental evaluation
- preprocessing
- quadratic programming
- high accuracy
- detection algorithm
- theoretical analysis
- objective function
- computational complexity
- matching algorithm
- expectation maximization
- learning algorithm
- np hard
- cost function
- k means
- simplex method
- recognition algorithm
- worst case
- significant improvement
- optimization algorithm
- linear program
- convex hull
- combinatorial optimization
- simplex algorithm
- markov random field
- energy function
- input data
- optimization problems
- computational cost
- evolutionary algorithm
- reinforcement learning
- similarity measure