McCormick-Based Relaxations of Algorithms
Theory and implementation for the global optimization of a wide class of algorithms is presented via convex/affine relaxations. The basis for the proposed relaxations is the systematic construction of subgradients for the convex relaxations of factorable functions by McCormick [Math. Prog., 10 (1976...
| Autors principals: | , , |
|---|---|
| Altres autors: | |
| Format: | Article |
| Idioma: | en_US |
| Publicat: |
Society for Industrial and Applied Mathematics
2010
|
| Accés en línia: | http://hdl.handle.net/1721.1/52407 https://orcid.org/0000-0003-2895-9443 |