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.
A Primal-Dual Interior-Point Algorithm for Nonsymmetric Conic Optimization
Overview
Syllabus
A primal-dual interior-point algorithm for nonsymmetric conic optimization
Taught by
Fields Institute
Related Courses
-
Optimization Algorithms: Theory and Software Implementation
-
Optimization: Interior Point Methods - Part 2
-
Primal-Dual Optimization Methods for Robust Machine Learning
-
Francisco Criado - The Dual 1-Fair Packing Problem and Applications to Linear Programming
-
Convex Optimization
4.9 -
Optimization: Interior Point Methods - Part 1
