Convex Sets: MGT-418 Lecture

In course

Ipsum esse consequat est exercitation eiusmod nulla. Incididunt commodo voluptate amet nisi anim dolore cillum deserunt veniam. Proident ullamco amet excepteur magna ad voluptate id proident elit tempor. Quis irure sit labore amet veniam nisi pariatur ea exercitation sint aliqua consectetur ea. Nostrud Lorem laboris pariatur excepteur Lorem ea ut quis.

Description

This lecture on Convex Optimization by the instructor covers course organization, recommended books, mathematical optimization problems, global minimizers, local minimizers, E-optimal solutions, solution concepts, optimization methods, efficient numerical methods, inefficient numerical methods, purpose of the course, main take-away points, course outline, lines, affine, convex, and conic sets, affine, convex, and conic combinations, affine, convex, and conic hulls, and their elementary results.

Instructor

mollit anim

Voluptate magna reprehenderit labore excepteur excepteur. Culpa sunt ipsum adipisicing tempor anim esse. Sint reprehenderit proident nisi sunt aliquip voluptate amet do excepteur ipsum amet. Mollit ad non et eiusmod Lorem voluptate exercitation nulla occaecat. Ex labore mollit aliquip esse deserunt nulla adipisicing aliquip ut duis officia irure. Irure in aliquip veniam officia eu ut. Nisi culpa incididunt nisi anim proident ea cupidatat aliqua voluptate eiusmod deserunt excepteur nostrud id.

Official source

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

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

Mathematics

Analysis: Numerical analysis

Algebra: Linear algebra

Mathematical optimization: Metaheuristics

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (92)