Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs.
Juan P. RuizIgnacio E. GrossmannPublished in: Comput. Chem. Eng. (2013)
Keyphrases
- global optimization
- convex relaxation
- answer sets
- semidefinite
- global optimality
- piecewise linear
- convex functions
- particle swarm optimization
- convex optimization
- ant colony algorithm
- global search
- lower bound
- finite dimensional
- quadratic program
- linear programming
- image completion
- np hard
- search capabilities
- pso algorithm
- logic programs
- imperialist competitive algorithm
- constrained global optimization
- quadratically constrained quadratic
- convex sets