EdusalsaDiscover Your Stanford

MS&E 311

Optimization (CME 307)

  • Not Offered

3 units

Letter or Credit/No Credit

Applications, theories, and algorithms for finite-dimensional linear and nonlinear optimization problems with continuous variables. Elements of convex analysis, first- and second-order optimality conditions, sensitivity and duality. Algorithms for unconstrained optimization, and linearly and nonlinearly constrained problems. Modern applications in communication, game theory, auction, and economics. Prerequisites: MATH 113, 115, or equivalent.

Course Prequisites

Sign Up

To save MS&E 311 to your course bucketlist

Already Have An Account? Log In