Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Linear Algebra Complexity
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.
Official source
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.