This course covers advanced theory, algorithms, and applications for convex and nonconvex optimization, including: subgradient methods, localization methods, decomposition methods, proximal methods, alternating direction methods of multipliers, conjugate direction methods, successive approximation methods, convex-cardinality problems, low-rank optimization problems, neural networks, semidefinite programming and relaxation, robust optimization, discrete optimization, stochastic optimization, etc.