A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems.
Le Thi Hoai AnPham Dinh TaoPublished in: J. Glob. Optim. (1998)
Keyphrases
- optimization problems
- objective function
- branch and bound method
- combinatorial optimization
- computational complexity
- globally convergent
- constrained problems
- quadratic optimization problems
- discrete optimization
- convex functions
- global optimization
- metaheuristic
- evolutionary algorithm
- learning algorithm
- mixed integer programming
- nonlinear programming
- lower bound
- branch and bound
- cost function
- newton method
- convex optimization
- constrained optimization
- lagrange multipliers
- quadratic program