Descent methods and line search: Preconditioned steepest descent

Related lectures (30)

Page 1 of 3

Explores optimal control and KKT conditions for non-linear optimization with constraints.

Explores optimization methods in machine learning, emphasizing gradients, costs, and computational efforts for efficient model training.

Covers convex optimization problems and gradient-based algorithms to find the global minimum.

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Covers semi-definite programming and optimization over positive semidefinite cones.

Covers optimization techniques in machine learning, focusing on convexity and its implications for efficient problem-solving.

Explores the role of computation in data mathematics, focusing on iterative methods, optimization, estimators, and descent principles.

Covers optimization without constraints using the gradient method to find the function's minimum.

Explores the link between linear systems and optimization through elimination and LU decomposition.

Explores stochastic optimization algorithms and methods for convex problems with smooth and nonsmooth risks.