ViewTube

... go over assignments we can go over any problem you may have within this class the course text is nonlinear programming you ...

Harvard Applied Math 205 is a graduate-level course on scientific computing and numerical methods. This video introduces Unit 4 ...

Review of Linear Algebra and Taylor series.

Sequential Quadratic Programming.

Barrier Method for linear programming.

Duality Theory I Source: OCW MIT - Massachusetts Institute of Technology More information is available in the playlist details.

Barrier Method, Linear programming with logarithmic barrier.

Barrier method for linear programming and its connection to affine-scaling method for linear programming.

Augmented Lagrangian method and method of multipliers.

Review of dynamic optimization: Maximum principle, dynamic programming and two-stage stochastic programming with recourse.

Review of linear algebra and calculus: norms, range space, null space, sequences, convergence of sequences.

Necessary and sufficient conditions for optimality in minimization problems, gradient descent methods.

Lagrange multiplier method and sensitivity theorem, problems with inequality constraints.

Sequential quadratic programming.

Convergence of gradient descent methods, Least square problems.

Manifold suboptimization method and its relationship to simplex method for linear programming.

Manifold suboptimization method.

Sensitivity Theorem, Optimization problems with inequality constraints.

Banach contraction mapping theorem and its application to proving convergence of optimization algorithms.

Necessary and sufficient conditions for optimality in constrained optimization, Projection theorem.