YoVDO

Heaviside Composite Optimization and Complementarity Constraints by Progressive Integer Programming

Offered By: Erwin Schrödinger International Institute for Mathematics and Physics (ESI) via YouTube

Tags

Nonconvex Optimization Courses Integer Programming Courses Quadratic Programming Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking approach to solving complex optimization problems in this 30-minute conference talk from the "One World Optimization Seminar in Vienna" workshop. Delve into the world of Heaviside composite functions and complementarity constraints, understanding their significance in various optimization scenarios. Learn about the innovative Progressive Integer Programming (PIP) method, which effectively leverages existing solver capabilities to tackle challenges beyond their normal scope. Discover how this elementary yet powerful technique can be applied to a wide range of nonconvex optimization problems, including those involving Heaviside composite functions and complementarity constraints. Gain insights from extensive computational results that demonstrate the promising potential of PIP in advancing the field of optimization.

Syllabus

Jong-Shi Pang - Heaviside composite optimization and complementarity constraints by a progressive...


Taught by

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

Related Courses

Linear and Discrete Optimization
École Polytechnique Fédérale de Lausanne via Coursera
Operations Research (1): Models and Applications
National Taiwan University via Coursera
Operations Research (2): Optimization Algorithms
National Taiwan University via Coursera
Dynamic Programming, Greedy Algorithms, and Intractability
University of Colorado Boulder via Coursera
Operations Research
SUNY Binghamton University via YouTube