Tractable Relaxations for the Cubic One-Spherical Optimization Problem.
Christoph BuchheimMarcia FampaOrlando SarmientoPublished in: WCGO (2019)
Keyphrases
- lower bound
- convex relaxation
- np hard
- global optimization
- optimization algorithm
- data sets
- optimization process
- optimal solution
- optimization problems
- linear programming
- b spline
- semidefinite
- optimization methods
- optimization method
- np complete
- special case
- evolutionary algorithm
- computational complexity
- three dimensional
- image segmentation
- case study