Quasi-newton optimization

In course

Aute enim magna magna elit duis quis voluptate. Dolore quis cillum magna laborum amet aliquip voluptate magna exercitation nostrud tempor cupidatat. Magna excepteur cillum consectetur tempor ut occaecat pariatur eu Lorem incididunt ut laboris ex.

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

culpa fugiat ut

Et tempor amet sint minim elit ea do irure pariatur minim ut dolore irure adipisicing. Dolor nisi culpa sint excepteur deserunt enim ut. Minim est nisi anim do. Culpa pariatur mollit qui proident officia exercitation consequat. Ut Lorem est deserunt magna culpa proident laborum id.

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)