Matrix Computations and Scientific Computing Seminar: Acorn Magic: How linear algebra solves optimization problems nonlinearly and why do it?

Seminar | February 15 | 11 a.m.-12 p.m. | 380 Soda Hall

 Martin Lee, MediaX, Stanford University

 Department of Mathematics

Recently, the speaker discovered a way to use matrix algebra to solve a set of nonlinear equations by first transforming them into an equivalent matrix equation and then finding the solutions analytically in terms of the elements of the inverse matrix of this equation. With the newly developed ACORN (an adaptive constrained optimal robust nonlinear) algorithm, it is possible to minimize an objective function without computing its derivatives. The convergence of this nonlinear analytic iterative formula requires the proper values of two control parameters (independent of the problem size). The speaker will describe how ACORN works and how it can be used to solve large-scale optimization problems with an innovative approach he calls Acorn Magic (minimization algorithms gathered in a cloud).

 events@math.berkeley.edu