Linear and Semidefinite Programming
Overview
Subject area
MAT
Catalog Number
644
Course Title
Linear and Semidefinite Programming
Department(s)
Description
Systems of linear inequalities, linear matrix inequalities, semidefinite programming. Convex sets in Euclidean n-space, spectrahedra, and spectrahedral shadows. Technology will be used to solve optimization problems.Prerequisite: A course in linear algebra.
Typically Offered
Fall, Spring
Academic Career
Graduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4