On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods.
Jérôme MalickFrédéric RoupinPublished in: Math. Program. (2013)
Keyphrases
- combinatorial optimization
- semidefinite
- nonlinear optimization
- optimization problems
- semidefinite programming
- traveling salesman problem
- metaheuristic
- convex relaxation
- upper bound
- interior point
- simulated annealing
- lower bound
- sufficient conditions
- objective function
- neural network
- special case
- interior point methods
- evolutionary algorithm
- computer vision