Ciclo Conferencias Magistrales del 45 Aniversario
Dr. Stephen Wright
Fecha: 10 de octubre
Hora: 10:30 am
Lugar: Auditorio Canavati
Optimization in Theory and Practice
Resumen: Complexity analysis in optimization seeks upper bounds on the amount of work required to find approximate solutions of optimization problems in a given class with a given algorithm. The relationship between theoretical complexity bounds and practical performance of algorithms on “typical” problems varies widely across problem and algorithm classes, and relative interest among researchers between the theoretical and practical aspects of algorithm design and analysis has waxed and waned over the years. This talk surveys complexity analysis and its relationship to practice in optimization, with an emphasis on linear programming and convex and nonconvex nonlinear optimization, providing historical perspectives on research in these areas.
