2 courses with the subject EEOR E, each shown exactly as we captured it from the college's catalog, with every element we hold. Where the wording looks broken, that is our reading of the catalog, not the college's text.
Prerequisites: (ELEN E3801) or ELEN E3801; or instructor's permission. Theory of convex optimization; numerical algorithms; applications in circuits, communications, control, signal processing and power systems
Prerequisites: (IEOR E6613) and (EEOR E4650) EEOR E4650 AND IEOR E6613 Convex sets and functions, and operations preserving convexity. Convex optimization problems. Convex duality. Applications of convex optimization problems ranging from signal processing and information theory to revenue management. Convex optimization in Banach spaces. Algorithms for solving constrained convex optimization problems
Source: Columbia University in the City of New York's catalog, linked per course · table learning_unit · CourseShelf publish 61
