IE 601 Optimization Theory Select Term:
Convex optimization and functional analysis; theory of duality; iterative methods and convergence proofs; interior point methods for linear programming; computational complexity of mathematical programming problems; extensions of linear programming.
SU Credits : 3.000
ECTS Credit : 10.000
Prerequisite : ( Masters Level IE 501 Minimum Grade of D )OR ( Doctorate IE 501 Minimum Grade of D )
Corequisite : -