Table of Contents:
  • Introduction to semidefinite, conic and polynomial optimization / MIguel F. Anjos and Jean B. Lasserre
  • The approach of moments for polynomial equations / Monique Laurent and Philipp Rostalski
  • Algebraic degree in semidefinite and polynomial optimization / Kristian Ranestad
  • Semidefinite representation of convex sets and convex hulls / J. William Helton and Jiawang Nie
  • Convex hulls of algebraic sets / Joa̋o Gouveia and Rekha Thomas
  • Convex relaxations and integrality gaps / Eden Chlamtac and Madhur Tulsiani
  • Relaxations of combinatorial problems via association schemes / Etienne de Klerk, Fernando M. de Oliveira Filho, and Dimitrii V. Pasechnik
  • Copositive programming / Samuel Burer
  • Invariant semidefinite programs / Christine Bachoc [and others]
  • A "joint+marginal" approach in optimization / Jean B. Lasserre
  • An introduction to formally real Jordan algebras and their applications in optimization / F. Alizadeh
  • Complementarity problems over symmetric cones: a survey of recent developments in several aspects / Akiko Yoshise
  • Convexity and semidefinite programming in dimension-free matrix unknowns / J. William Helton, Igor Klep, and Scott McCullough
  • Positivity and optimization: beyond polynomials / Jean B. Lasserre and Mihai Putinar
  • Self-regular interior-point methods for semidefinite optimization / Maziar Salahi and Tamás Terlaky
  • Elementary optimality conditions for nonlinear SDPs / Florian Jarre
  • Recent progress in interior-point methods: cutting-plane algorithms and warm starts / Alexander Engau
  • Exploiting sparsity in SDP relaxation of polynomial optimization problems / Sunyoung Kim and Masakazu Kojima
  • Block coordinate descent methods for semidefinite programming / Zaiwen Wen, Donald Goldfarb, and Katya Scheinberg
  • Projection methods in conic optimization / Didier Henrion and Jérôme Malick
  • SDP relaxations for non-commutative polynomial optimization / Miguel Navascués, Stefano Pironio, and Antonio Acín
  • Semidefinite programming and constraint programming / Willem-Jan van Hoeve
  • The state-of-the-art in conic optimization software / Hans D. Mittelmann
  • Latest developments in the SDPA family for solving large-scale SDPs / Makoto Yamashita [and others]
  • On the implementation and usage of SDPT3: a MATLAB software package for semidefinite-quadratic-linear programming, version 4.0 / Kim-Chuan Toh, MIchael J. Todd, and Reha H. Tütüncü
  • SDP relaxations for some combinatorial optimization problems / Renata Sotirov
  • Computational approaches to max-cut / Laura Palagi [and others]
  • Global approaches for facility layout and VLSI floorplanning / Miguel F. Anjos and Frauke Liers
  • Euclidian distance matrices and applications / Nathan Krislock and Henry Wolkowicz
  • Sparse PCA: convex relaxations, algorithms and applications / Youwei Zhang, Alexandre d'Aspremont, and Laurent El Ghaoui.