## Reformulation and Convex Relaxation Techniques for Global Optimization (2004)

### Cached

### Download Links

- [www.lix.polytechnique.fr]
- [www.lix.polytechnique.fr]
- DBLP

### Other Repositories/Bibliography

by
Leo Sergio Liberti

Venue: | 4OR |

Citations: | 9 - 7 self |

### BibTeX

@TECHREPORT{Liberti04reformulationand,

author = {Leo Sergio Liberti},

title = {Reformulation and Convex Relaxation Techniques for Global Optimization},

institution = {4OR},

year = {2004}

}

### OpenURL

### Abstract

Many engineering optimization problems can be formulated as nonconvex nonlinear programming problems (NLPs) involving a nonlinear objective function subject to nonlinear constraints. Such problems may exhibit more than one locally optimal point. However, one is often solely or primarily interested in determining the globally optimal point. This thesis is concerned with techniques for establishing such global optima using spatial Branch-and-Bound (sBB) algorithms.