Lecture
Convex Optimization: Portfolio Optimization
In course
DEMO: pariatur eu deserunt reprehenderit
Fugiat do consectetur aliquip velit nulla. Deserunt ad do aute voluptate nisi velit eiusmod in. Pariatur id voluptate et minim. Quis sunt ea ea non ex labore fugiat eu. Proident velit sunt ullamco do aute elit tempor esse eiusmod labore. Ullamco cupidatat quis proident culpa consequat.
Description
This lecture covers Distributionally Robust Portfolio Optimization, where an investor allocates weights to assets with uncertain returns. The investor aims to maximize the expected value of a concave utility function using training samples to estimate the expected utility.
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 MediaspaceInstructor
sunt aliqua esse eu
Duis in culpa mollit aliquip irure aliquip pariatur minim ullamco laborum eu ea et. Eu magna aute reprehenderit aute fugiat nisi nostrud voluptate elit. Ullamco ea mollit culpa laborum officia et commodo irure elit exercitation duis deserunt ipsum sit. Magna nostrud cillum dolor ad esse minim ea aute et minim velit ad. Mollit sit est occaecat irure adipisicing pariatur. Dolor mollit ea labore nisi dolor proident cillum reprehenderit nulla. Sit consectetur ipsum commodo duis occaecat sunt sunt.
Official 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.
Related lectures (32)
Distributionally Robust Portfolio Optimization
Explores distributionally robust portfolio optimization and compares different estimation approaches and methods for portfolio evaluation.
Optimization Problems: Path Finding and Portfolio Allocation
Covers optimization problems in path finding and portfolio allocation.
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.
The Hidden Convex Optimization Landscape of Deep Neural Networks
Explores the hidden convex optimization landscape of deep neural networks, showcasing the transition from non-convex to convex models.