The number of ECE ILLINOIS' faculty members.
|Introduction to Optimization||CSE441||P3||33980||DIS||1100 - 1220||T R||2017 ECE Building||Negar Kiyavash|
|Introduction to Optimization||CSE441||P4||54361||DIS||1100 - 1220||T R||2017 ECE Building||Negar Kiyavash|
|Introduction to Optimization||ECE490||P3||33979||DIS||1100 - 1220||T R||2017 ECE Building||Negar Kiyavash|
|Introduction to Optimization||ECE490||P4||54360||DIS||1100 - 1220||T R||2017 ECE Building||Negar Kiyavash|
The course objective is to provide seniors in Electrical or Computer Engineering with a basic under-standing of optimization problems, viz., their formulation, analytic and computational tools for their solutions, and applications in different areas.
Same as CSE 541
This course is taught once a year every spring semester, and is elective for seniors in electrical and computer engineering programs. Its main objective is to provide these students with a basic understanding of optimization problems, viz., their formulation, analytic and computational tools for their solutions, and applications in different areas.
By the end of the semester, the students should be able to do the following:
1. Formulate finite-dimensional optimization problems (a)
2. Apply some sufficiency conditions to an optimization method to test whether a minimum or a maximum exists, and whether they are unique (a)
3. Tell the difference between a local optimum and a global optimum (a)
4. Use the first- and second-order conditions for unconstrained optima to calculate minima and maxima (a)
5. Use various computational algorithms for unconstrained optimization, including steepest descent, Newton's method, conjugate-direction methods, and direct search methods (a)
6. Analyze convergence of the algorithms in 5 above (a)
8. Obtain analytic solutions to some relatively simple optimization problems with equality constraints, using Lagrange multipliers (a)
9. Obtain analytic solutions to some relatively simple optimization problems with inequality constraints, again using Lagrange multipliers (a)
10. Use various computational algorithms for constrained optimization, including penalty function methods, primal and dual methods, penalty and barrier methods, and convex programming (a)
11. Analyze convergence of the algorithms in 10 above (a)
12. Conduct sensitivity analysis using Lagrange multipliers (a)
14. Tell whether a linear programming problem has a solution or not (a)
15. Know what duality is in linear programming (a)
16. Employ the Simplex method in computing optimal solutions and write software that implements the Simplex Method (a)