- Schedule
- Introduction Lecture 1
- Background Review Lecture 2 and Lecture 3
- Linear Complementarity Problems Lecture 4 part I and Homework 1
- Geometry of Linear Complementarity Problems Lecture 4 part II
- Existence of Solutions for VI's: Compact Sets Lecture 5
- Existence of Solutions for VI's: Absence of Compactness Lecture 6 and Homework 2
- Solutions for Monotone VI's Lecture 7
- F-uniqueness, Equivalent Formulations of VI's Lecture 8
- Monotone VI's and CP's: Polyhedrality of Solution Set Lecture 9
- General Existence Results, Nondifferentiable Mappings Lecture 10
- Newton Method for Nondifferentiable System of Equations Lecture 11
- Newton Method for Piecewise Differentiable and Composite System of Equations Lecture 12
- Newton Method for Variational Inequalities Lecture 13 and Homework 3
- Globally Convergent Newton Method Lecture 14
- Line Search Methods Lecture 15
- Application of Line Search Method, Trust Region Method Lecture 16
- Equation-Based Algorithms for Complementarity Problems Lecture 17
- Equation-Based Algorithms for Complementarity Problems: Regularity and Extensions Lecture 18
- Algorithms for Variational Inequalities: KKT-Based Approaches Lecture 19 and Homework 4
- Algorithms for Variational Inequalities: Merit Function-Based Approaches Lecture 20
- Algorithms for Monotone Variational Inequalities: Projection Methods Lecture 21
- Algorithms for Monotone Variational Inequalities: Tikhonov Regularization and Proximal-Point Methods Lecture 22
- Problem set supplement I Exercises I