Nonlinear Programming, 2004 , MIT
Description: This course introduces students to the fundamentals of nonlinear optimization theory and methods. Topics include unconstrained and constrained optimization, linear and quadratic programming, Lagrange and conic duality theory, interior-point algorithms and theory, Lagrangian relaxation, generalized programming, and semi-definite programming. Algorithmic methods used in the class include steepest descent, Newton's method, conditional gradient and subgradient optimization, interior-point methods and penalty and barrier methods.
Views: 350
Rating: 0
0 Comments
Views: 228
Rating: 0
0 Comments
Views: 382
Rating: 0
0 Comments
Views: 400
Rating: 0
0 Comments
Views: 307
Rating: 0
0 Comments
Views: 264
Rating: 0
0 Comments
Views: 295
Rating: 0
0 Comments
Views: 406
Rating: 0
0 Comments
Views: 375
Rating: 0
0 Comments
Views: 275
Rating: 0
0 Comments
| Course Members |
New York USA
Massachusetts Institute of Technology, Massachusetts
|
