EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1835. Convexification of optimization problems involving the Euclidean norm
Invited abstract in session WB-4: Mixed Integer Nonlinear Programming and Nonconvex Optimization , stream MINLP.
Wednesday, 10:30-12:00Room: 1001 (building: 202)
Authors (first author is the speaker)
| 1. | Nikolaos Sahinidis
|
| Georgia Institute of Technology | |
| 2. | Anatoliy Kuznetsov
|
| Georgia Institute of Technology |
Abstract
Several important open problems in chemical physics, mathematics, and operations research can be posed as nonconvex global optimization problems involving the Euclidean norm. For example, pairwise potential energy minimization, object packing and cutting, the kissing number problem, and planar facility location problems admit a representation of this form. We present new formulations and convexification strategies for problems involving the Euclidean norm and use them to solve several instances to global optimality for the first time.
Keywords
- Branch and Cut
- Global Optimization
Status: accepted
Back to the list of papers