Lecture
Line Search: Optimization Basics
Description
This lecture covers the fundamentals of optimization in geometric computing, focusing on the concept of making a geometric object stand by finding the best modification efficiently through unconstrained optimization. Topics include derivative checks, convergence to local minimum, choosing a step size, and line search algorithms like Armijo, Wolfe, and Strong Wolfe conditions.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on MediaspaceOfficial 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.