AE 725
Aerospace Engineering
University of Kansas · Fall 2026
2 sections2 open now
Catalog description
Classical theories of unconstrained and constrained optimization. Numerical techniques for unconstrained optimization, including the steepest descent, conjugate gradient and "Newton's" methods. Numerical techniques for constrained optimization, including sequential approximate problem techniques as well as the method of feasible directions. Computer aided solutions to practical design problems in aerospace engineering. Final design project. Prerequisite: C- or higher in MATH 220 or MATH 221 and MATH 290 or MATH 291.
Sections
Current meeting, instructor, credit, and enrollment details
1000
17 openSeats: 8/25 seats Last recorded: Jul 30, 2026, 1:16 AMClass #22871Fall 20263 credits
17 available8 enrolled25 capacity
- Days & times
- Tu Th · 12:30 – 1:45 PM
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Section notes
Source career: GRDL
Details checked 15 hours agoSeats checked 15 hours ago
2000
5 openSeats: 0/5 seats Last recorded: Jul 30, 2026, 1:16 AMClass #22944Fall 20263 credits
5 available0 enrolled5 capacity
- Days & times
- Tu Th · 12:30 – 1:45 PM
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Section notes
Source career: GRDL
Details checked 15 hours agoSeats checked 15 hours ago
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?