Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems.
Sunyoung KimMasakazu KojimaHayato WakiPublished in: SIAM J. Optim. (2005)
Keyphrases
- optimization problems
- evolutionary algorithm
- cost function
- metaheuristic
- lower bound
- objective function
- np hard
- binary matrices
- smooth functions
- eigenvalue decomposition
- compressed sensing
- sparse data
- optimization methods
- random variables
- high dimensional
- knapsack problem
- low order
- sparse matrix
- convex optimization problems
- relaxation algorithm
- upper bound