An effective global algorithm for worst-case linear optimization under polyhedral uncertainty.
Huixian WuHezhi LuoXianye ZhangHaiqiang QiPublished in: J. Glob. Optim. (2023)
Keyphrases
- worst case
- optimization algorithm
- learning algorithm
- np hard
- average case
- k means
- times faster
- segmentation algorithm
- theoretical analysis
- space complexity
- constrained optimization
- recognition algorithm
- optimization method
- computationally efficient
- lower bound
- cost function
- optimal solution
- computational complexity
- combinatorial optimization
- experimental evaluation
- detection algorithm
- stochastic gradient
- convex hull
- linear programming
- simulated annealing
- dynamic programming
- matching algorithm
- computational cost
- neural network
- greedy algorithm
- upper bound
- optimization process
- preprocessing
- optimization model
- online algorithms
- high accuracy