 |
Center for Nonlinear Studies |
In this lecture, we fill in the blanks left in our typical interior-point algorithm. We show how to solve its subproblems intuitively and efficiently. We next combine trust-regions and either a merit function or a filter to ensure global convergence to a critical point.
Host: DDMA Data Sciences Summer School - Katharine Chartrand