Grades:
Median GPA:
Mean GPA:
Click a checkbox to add something to compare.
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
UTD TRENDSGrades:
Median GPA:
Mean GPA:
Click a checkbox to add something to compare.
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Engineering Optimization
MECH 6318
Erik Jonsson School of Engineering and Computer Science
Basics of optimization theory, numerical algorithms, and applications in engineering. The course covers linear programming (simplex method) and nonlinear programming, as well as unconstrained methods (optimality conditions, descent algorithms and convergence theorems), and constrained minimization (Lagrange multipliers, Karush-Kuhn-Tucker conditions, active set, penalty and interior point methods). Non-gradient based optimization methods are briefly introduced. Applications in mechanical engineering design will be emphasized. Students will use Matlab's Optimization Toolbox to obtain practical experience with the material. 3 credit hours.
Offering Frequency: Each year
Grades: 362
Median GPA: A-
Mean GPA: 3.524
Click a checkbox to add something to compare.
Engineering Optimization
MECH 6318
Erik Jonsson School of Engineering and Computer Science
Basics of optimization theory, numerical algorithms, and applications in engineering. The course covers linear programming (simplex method) and nonlinear programming, as well as unconstrained methods (optimality conditions, descent algorithms and convergence theorems), and constrained minimization (Lagrange multipliers, Karush-Kuhn-Tucker conditions, active set, penalty and interior point methods). Non-gradient based optimization methods are briefly introduced. Applications in mechanical engineering design will be emphasized. Students will use Matlab's Optimization Toolbox to obtain practical experience with the material. 3 credit hours.
Offering Frequency: Each year
Grades: 362
Median GPA: A-
Mean GPA: 3.524
Click a checkbox to add something to compare.