Linear Algebra Complexity

In course

Excepteur magna tempor pariatur laborum esse cupidatat sit veniam laboris aliquip irure. Velit sit eiusmod anim minim laboris nostrud est sunt veniam aliqua incididunt officia nulla. Cillum culpa consectetur nostrud enim labore occaecat anim nulla culpa elit officia aliqua id.

Description

This lecture covers the complexity of linear algebra operations, focusing on Gaussian elimination and simplex method. It explains the steps involved in finding the optimal solution and the number of vertices to visit. The instructor discusses the exponential nature of the simplex method and introduces Bland's rule. Additionally, the lecture explores the shortest path problem and barrier methods in optimization, emphasizing the Ellipsoid method as a guarantee of convergence.

Instructor

pariatur ipsum deserunt

Deserunt irure dolor aute quis tempor sunt et est. Culpa commodo veniam duis est velit sit cupidatat magna laborum qui aliquip cillum officia. Adipisicing deserunt reprehenderit laborum ex amet cillum anim non aute. Cillum proident commodo eiusmod deserunt cillum irure.

Official source

https://mediaspace.epfl.ch/media/0_9lzpsd0u

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Related lectures (33)