Feedback
Loading...

Add to Buffet

Save course to Your Buffet - Get notified, Track Progress, Plan Future Learning.
1 People Have this course in their Buffet

Numerical Optimization

Course Description:

Introduction. Mathematical Background, including convex sets and functions. Need for constrained methods in solving constrained problems. Unconstrained optimization: Optimality conditions, Line Search Methods, Quasi-Newton Methods, Trust Region Methods. Conjugate Gradient Methods. Least Squares Problems. Constrained Optimization: Optimality Conditions and Duality. Convex Programming Problem. Linear Programming Problem. Quadratic Programming. Dual Methods, Penalty and Barrier Methods, Interior Point Methods.

  • Instructor(s) Shirish K. Shevade
  • University
  • Provider
  • Start Date Always Available
  • Duration Always Available
  • Main Language English
Did you find any errors in this course listing ? Help us improve and we would be eternally grateful

Related Courses

Other Math Courses

Course Reviews

  • No Comments Yet! Be the first one to comment.