World Mentoring Academy "An Open Community for Successful Learning"

Free World class mobile education, earn a Bachelors for less than $5,000 books & Test Fees from State Universities, using Experiential, Design & Project based education. Supporting credit-by-exam & Challenging University courses.

Creative Commons License
Expand/collapse block About & Angel Club

$365 given2017 Join this project

Help $29 in treasury 

Expand/collapse block Login
Keep me logged in
Expand/collapse block Selected courses
Expand/collapse block Information for lesson "Numerical Optimization NPTEL CC-E"
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.
Resources: OpenCourseware from India NPTEL, MIT, UC Berkeley, Stanford along with many of the World's finest University's.
Language: English
Professors: Michael Williams
Enroll Enroll