Linear Algebra: Efficiency and Complexity

Related lectures (29)

Page 1 of 3

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Explores convex polyhedra, linear programs, and their optimization importance.

Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Explores orthogonal projections, symmetry of matrices, and their applications.