Brief History of Convex Optimization theory (convex analysis):ca1900-1970 algorithms 1947:simplex algorithm for linear programming (Dantzig) 1960s:early interior-point methods(Fiacco McCormick,Dikin,...) 1970s:ellipsoid method and other subgradient methods 1980s:polynomial-time interior-point methods for linear programming (Karmarkar 1984) late 1980s-now:polynomial-time interior-point methods for nonlinear convex optimization (Nesterov Nemirovski 1994) applications before 1990:mostly in operations research;few in engineering since 1990:many new applications in engineering (control,signal processing,communications,circuit design,...)new problem classes (semidefinite and second-order cone programming,robust optimization) CLGO System Engineering by J.J.Gao 12+ - System Engineering by J. J. Gao 12 Brief History of Convex Optimization