A Primal-Dual Interior-Point Algorithm for Nonsymmetric Conic Optimization
Offered By: Fields Institute via YouTube
Course Description
Overview
Explore a comprehensive lecture on a primal-dual interior-point algorithm for nonsymmetric conic optimization, presented by Erling Andersen from MOSEK ApS. Delivered as part of the Optimization: Theory, Algorithms, Applications Lecture Series at the Fields Institute, this 82-minute talk delves into advanced optimization techniques and their applications. Gain insights into the intricacies of interior-point algorithms and their role in solving complex conic optimization problems, particularly those involving nonsymmetric cones.
Syllabus
A primal-dual interior-point algorithm for nonsymmetric conic optimization
Taught by
Fields Institute
Related Courses
Linear and Integer ProgrammingUniversity of Colorado Boulder via Coursera Maths Essentials
Imperial College London via edX Introduction To Soft Computing
Indian Institute of Technology, Kharagpur via Swayam Artificial Intelligence
Udacity Математические методы и модели в экономике
National Research Nuclear University MEPhI via Coursera