University of Cambridge > Talks.cam > CCIMI Short course: First-order methods for large scale optimisation problems > First-order methods for large scale optimisation problems - Convex optimization problems and optimality

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

First-order methods for large scale optimisation problems - Convex optimization problems and optimality

Download to your calendar using vCal

If you have a question about this talk, please contact Rachel Furner .

Part of the CCIMI short course ‘First-order methods for large scale optimisation problems’

Instructor: Stephen Becker, University of Colorado

Lecture 2: Convex optimization problems and optimality Convex optimization problems are defined, and classical structured problems (LP, SOCP , SDP) are introduced. Topics include: duality, optimality, KKT conditions, sensitivity, strong duality, Slater’s conditions and other constraint qualifications, and degeneracy. There will be an interlude discussing example problems from machine learning, compressed sensing, and other fields.

This talk is part of the CCIMI Short course: First-order methods for large scale optimisation problems series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar (via Zoom online) Webinar & FW11, Computer Laboratory, William Gates Building. https://zoom.us/j/92122653765?pwd=ZGk1ZTZFVllBSHhvaVkrRUpZRzM4dz09

Other talks

Online Causal Inference Seminar TBC The Neurophenomenology of Surrender: Agency, Renewal, and Social Engagement in Speaking in Tongues Title to be confirmed Title to be confirmed What Can a Spectrum Learn? AI Perspectives on the Kohn Laplacian of Sphere Quotients
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity