Quadratic Programming Courses and Certifications

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)

Institute for Pure & Applied Mathematics (IPAM)

Beyond Physical Maze Solvers via Modern Portfolio Theory

Explore portfolio optimization, kernel embeddings, and maze-solving algorithms. Discover connections between financial theory and computational problem-solving in this advanced mathematics lecture.

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

Applied Control Systems 2: autonomous cars (360 tracking)

161 ratings at Udemy

system modeling + state space systems + Model Predictive Control + MPC constraints + Python simulation: autonomous cars

• Udemy
• 13 hours 35 minutes
• On-Demand
• Paid Course

Convex Optimization I - 2023

Master convex optimization fundamentals and applications across engineering, finance, and machine learning through Stanford's comprehensive mathematical framework and solution techniques.

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

Mathematical Optimization for Business Problems

Learn mathematical programming fundamentals to model and solve optimization problems using IBM Decision Optimization technology, covering key concepts, techniques, and algorithms.

• Cognitive Class
• 6 hours
• On-Demand
• Free Online Course

NPTEL;  IIT Kharagpur

Optimal Control

Comprehensive exploration of optimization techniques, from unconstrained problems to dynamic optimization, covering linear and non-linear programming, optimal control, and robust stability analysis.

• YouTube
• 2 days 10 hours
• On-Demand
• Free Video

Simons Institute

Every Optimization Problem Is a Quadratic Program

Explore how diverse optimization problems can be reframed as quadratic programs, offering insights into reinforcement learning theory and practical applications.

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

MITCBMM

Regularized Least Squares

Explore statistical learning theory with Lorenzo Rosasco, focusing on regularized least squares, optimization techniques, and key concepts in machine learning algorithms.

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

Society for Industrial and Applied Mathematics

Applications of Bernstein's Other Theorem in Geometry and Algebra

Explore applications of Bernstein's Other Theorem in polynomial systems, focusing on non-general yet Bernstein-general cases from various fields, and their optimal solution methods.

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

Society for Industrial and Applied Mathematics

Mathematics in Computer Animation - Pixar's Approach

Pixar engineer explores mathematical techniques behind computer-animated effects, including dynamic simulations for clothing, hair, and 3D interactive animation, showcasing real-world applications in film production.

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

ACM SIGPLAN

Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs

Explore algebro-geometric algorithms for template-based synthesis of polynomial programs, offering a scalable approach to program sketching without sacrificing completeness.

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

Institute for Mathematical Sciences

Primal-Dual Optimization Methods for Robust Machine Learning

Explore primal-dual optimization techniques for enhancing machine learning robustness, focusing on advanced mathematical approaches to improve model performance and reliability.

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

Erwin Schrödinger International Institute for Mathematics and Physics (ESI)

Heaviside Composite Optimization and Complementarity Constraints by Progressive Integer Programming

Explore advanced optimization techniques for Heaviside composite functions and complementarity constraints using the progressive integer programming method.

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

NPTEL-NOC IITM

More on Conjugate Directions Method

Delve into the conjugate directions method, exploring its principles and the expanding subspace theorem for optimization problems.

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

Paul G. Allen School

Complexity of Finding Local Minima in Continuous Optimization

Exploring complexity of finding local minima in continuous optimization, focusing on polynomial problems. Discusses unconstrained and constrained cases, NP-hardness, and semidefinite programming equivalence.

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