Linear Programming Courses and Certifications

Simons Institute

LP, SOCP, and Optimization-Free Approaches to Polynomial Optimization

Explore advanced techniques in polynomial optimization, including LP, SOCP, and optimization-free methods, with a focus on hierarchies and matrix-analytic approaches.

• YouTube
• 32 minutes
• On-Demand
• Free Video

The Julia Programming Language

The State of JuMP - Progress and Future Plans

Explore JuMP's progress, new features, and future plans for mathematical optimization in Julia. Learn about governance changes, NSF funding, and how to get involved in this powerful modeling language.

• YouTube
• 25 minutes
• On-Demand
• Free Video

PapersWeLove

A Case for Correctly Rounded Math Libraries

Explore the RLIBM project's approach to building correctly rounded elementary functions, revolutionizing polynomial approximations for enhanced mathematical precision in computing.

• YouTube
• 43 minutes
• On-Demand
• Free Video

Convex Optimization

7 reviews

Explore convex optimization techniques for engineering and scientific applications, covering theory, analysis, and practical problem-solving in various fields like signal processing and machine learning.

• edX
• 8 weeks, 10-15 hours a week
• On-Demand
• Free Online Course (Audit)

Hausdorff Center for Mathematics

On Circuit Imbalance Measures and Their Role in Circuit Augmentation Algorithms

Explore new combinatorial condition numbers for linear and integer programs, their relation to existing measures, and their impact on circuit diameter bounds and simplex methods.

• YouTube
• 25 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Polyhedral Geometry of Pivot Rules

Explore the geometric perspective on pivot rules in linear programming, connecting polyhedra, simplex methods, and arborescences to gain insights into optimization algorithms.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Performance of Steepest Descent in 0/1 LPs

Explores steepest descent in 0/1 LPs, proving polynomial-length paths and developing a new pivot rule for the Simplex method. Unifies circuit and edge steps, advancing understanding of combinatorial optimization.

• YouTube
• 25 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Introduction to Parameterized Algorithms and Applications

Explore parameterized complexity and its applications in discrete optimization, focusing on LP-guided techniques, Lenstra's algorithm, and structured ILPs using Graver bases.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Simon Foucart: Essentials of Compressive Sensing

Explore advanced concepts in Compressive Sensing, including reconstruction algorithms, matrix coherence, and random measurements, building on foundational theory for efficient high-dimensional data acquisition.

• YouTube
• 1 hour 12 minutes
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Neural Network Verification as Piecewise Linear Optimization

Neural network verification as piecewise linear optimization: exploring robust methods to prove model reliability against attacks, using LP and MIP formulations for efficient problem-solving in various network types.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Fields Institute

HiGHS - Theory, Software and Impact

Explore the theory, software, and impact of HiGHS optimization solver, covering simplex methods, hyper-sparsity, parallel solutions, and performance across various problem types.

• YouTube
• 55 minutes
• On-Demand
• Free Video

Society for Industrial and Applied Mathematics

The Geometry of the Space of All Pivot Rules of a Linear Optimization Problem

Explore the geometric aspects of pivot rules in linear optimization with Jesús A. De Loera. Gain insights into advanced mathematical concepts and their applications in industrial problem-solving.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Simons Institute

Constructing Extended Formulations

Explore advanced techniques for constructing extended formulations in combinatorial optimization, focusing on polytopes, matchings, cycles, and spanning trees in various graph types.

• YouTube
• 1 hour 7 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear Programs - Lecture

Explore a novel method for solving infeasible low-dimensional linear programs efficiently, using convex hull as an intermediate representation to improve performance in creating correctly rounded math libraries.

• YouTube
• 18 minutes
• On-Demand
• Free Video

Machine Learning With Hamza

Visual Optimization Solver - Graphical Solution and LLM-Generated Reports

Explore a graphical solver for mathematical optimization, visualizing function minimization with equality constraints and generating LLM-based reports for enhanced understanding.

• YouTube
• 23 minutes
• On-Demand
• Free Video