| 375 | -- | 377 | Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer. The 2013 Newton Institute Programme on polynomial optimization |
| 379 | -- | 404 | Edwin R. van Dam, Renata Sotirov. Semidefinite programming and eigenvalue bounds for the graph partition problem |
| 405 | -- | 431 | Javier Peña, Juan Carlos Vera, Luis Fernando Zuluaga. Completely positive reformulations for polynomial optimization |
| 433 | -- | 457 | Etienne de Klerk, Monique Laurent, Zhao Sun. An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex |
| 459 | -- | 476 | Immanuel M. Bomze, Michael L. Overton. Narrowing the difficulty gap for the Celis-Dennis-Tapia problem |
| 477 | -- | 506 | Victor Magron, Xavier Allamigeon, Stéphane Gaubert, Benjamin Werner. Certification of real inequalities: templates and sums of squares |
| 507 | -- | 527 | Jean B. Lasserre. Tractable approximations of sets defined with quantifiers |
| 529 | -- | 553 | David de Laat, Frank Vallentin. A semidefinite programming hierarchy for packing problems in discrete geometry |
| 555 | -- | 583 | Jiawang Nie. The hierarchy of local minimums in polynomial optimization |
| 585 | -- | 612 | John Christian Ottem, Kristian Ranestad, Bernd Sturmfels, Cynthia Vinzant. Quartic spectrahedra |
| 613 | -- | 637 | João Gouveia, Pablo A. Parrilo, Rekha R. Thomas. Approximate cone factorizations and lifts of polytopes |
| 639 | -- | 658 | Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford. Cutting planes for RLT relaxations of mixed 0-1 polynomial programs |
| 659 | -- | 680 | Cristian Dobre, Juan Vera. Exploiting symmetry in copositive programs via semidefinite hierarchies |