Verifying Global Optimality of Candidate Solutions to Polynomial Optimization Problems using a Determinant Relaxation Hierarchy.
Sikun XuRuoyi MaDaniel K. MolzahnHassan HijaziCédric JoszPublished in: CDC (2021)
Keyphrases
- candidate solutions
- optimization problems
- global optimality
- objective function
- semidefinite
- optimal solution
- globally optimal
- evolutionary algorithm
- global optimization
- convex relaxation
- metaheuristic
- optimization methods
- combinatorial optimization problems
- cost function
- discrete optimization
- linear programming
- multi objective
- global minimum
- convex functions
- nonlinear programming
- benchmark problems
- search space
- combinatorial optimization
- lower bound
- solution space
- knapsack problem
- test problems
- traveling salesman problem
- genetic algorithm
- optimality conditions
- optimization process
- feasible solution
- genetic operators
- final result
- global solution
- neural network
- gray scale
- np hard
- lower level
- gradient field