Nonconvex constrained optimization by a filtering branch and bound.
Gabriele EichfelderKathrin KlamrothJulia NieblingPublished in: J. Glob. Optim. (2021)
Keyphrases
- constrained optimization
- branch and bound
- objective function
- lower bound
- optimal solution
- lagrange multipliers
- branch and bound algorithm
- search algorithm
- stationary points
- upper bound
- column generation
- search space
- constrained optimization problems
- combinatorial optimization
- optimization problems
- unconstrained optimization
- constraint handling
- penalty function
- branch and bound method
- global optimization
- branch and bound search
- convex optimization
- branch and bound procedure
- augmented lagrangian
- inequality constraints
- randomly generated problems
- np hard
- network design problem
- tree search
- linear programming
- tree search algorithm
- cutting plane
- knapsack problem
- penalty functions
- traveling salesman problem