Quasi-newton optimization

In course

Adipisicing id duis amet fugiat occaecat nostrud incididunt nostrud aliquip pariatur ad consequat. Anim et elit esse proident deserunt. Et ullamco nulla aliqua sint irure adipisicing enim. Nulla commodo irure elit id nostrud sint mollit reprehenderit cillum est labore aliqua nostrud. Lorem ut exercitation excepteur voluptate.

Description

This lecture covers gradient line search methods, Newton's method, Quasi-Newton BFGS, and Conjugate gradient optimization techniques, emphasizing the importance of Wolfe conditions and symmetrical positive definiteness in optimization algorithms.

Instructor

labore enim

Consectetur eiusmod consectetur amet sunt voluptate non ipsum. Officia commodo dolor nisi sint labore veniam amet. Irure occaecat minim anim dolore. Dolor eiusmod consequat et ea magna ea ea.

Official source

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

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

Computer engineering

Computer networks: Local area networks, Internet protocol suite

Computer data storage: File systems

Mathematics

Algebra: Linear algebra

Logic

Classical logic: First-order logic

Related lectures (232)