Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint.
Le Thi Hoai AnMohand OuanesPublished in: RAIRO Oper. Res. (2006)
Keyphrases
- global optimization
- branch and bound
- convex quadratic
- inequality constraints
- nonlinear programming
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- column generation
- optimal solution
- upper bound
- interior point methods
- particle swarm optimization
- combinatorial optimization
- constrained optimization
- equality constraints
- pso algorithm
- tree search
- variational inequalities
- convex optimization
- optimization problems
- optimality conditions
- linear constraints
- sat problem
- max sat
- optimization algorithm
- metaheuristic