A very short account on G.O. strategies

1. Simplest G.O. problems: quadratic optimization

1a.  Local versus global optimality; complexity issues
1b.  Extremal increments and optimality conditions
1c.  Standard Quadratic Problems (StQPs)       
1d.  Why StQPs play a central role in global QPs

2. Some basic techniques, illustrated by Standard QPs  (StQPs)

2a. Local search and escape directions

2b. Bounding and additive decompositions
2c. Branch-and-bound: principles and special cases

3. Reformulation, relaxation, approximation (of StQPs)

3a. Unconstrained reformulations      
3b. Convex conic reformulations           
3c. Copositive programming

4a. Copositivity detection
4b. Approximation hierarchies
4c. Further applications of copositive optimization