A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems.
Juan S. CamposPanos ParpasPublished in: SIAM J. Optim. (2018)
Keyphrases
- optimization problems
- semidefinite
- semidefinite programming
- evolutionary algorithm
- sparse linear
- convex relaxation
- linear programming
- metaheuristic
- objective function
- multiresolution
- optimization methods
- image analysis
- lower bound
- boundary conditions
- cost function
- knapsack problem
- semi definite programming
- traveling salesman problem
- sparse data
- multiscale
- sparse representation
- high dimensional
- convex optimization
- np hard
- sparse coding
- combinatorial optimization
- graph cuts
- level set
- sparse matrix
- image processing
- stochastic dynamic programming