{"179081":{"#nid":"179081","#data":{"type":"event","title":"Michael J. Todd, Cornell University","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ESpeaker\u003C\/strong\u003E\u003Cbr \/\u003EMichael J. Todd\u003Cbr \/\u003ELeon C. Welch Professor\u003Cbr \/\u003ESchool of Operations Research and Information Engineering\u003Cbr \/\u003ECornell University\u003Cbr \/\u003E\u003Cbr \/\u003E\u003Cstrong\u003EAbstract\u003C\/strong\u003E\u003Cbr \/\u003EWe discuss the convergence properties of first-order methods for two problems that arise in computational geometry and statistics: the minimum-volume enclosing ellipsoid problem and the minimum-area enclosing ellipsoidal cylinder problem for a set of m points in R^n. The algorithms are old but the analysis is new, and the methods are remarkably effective at solving large-scale problems to high accuracy.\u003Cbr \/\u003E\u003Cbr \/\u003E\u003Cbr \/\u003E\u003Cstrong\u003EBio\u003C\/strong\u003E\u003Cbr \/\u003EDr. Mike J. Todd is well-known for his contributions to linear and nonlinear optimization and game theory. His research interests are in algorithms for linear and convex programming, particularly semidefinite programming. He is interested in developing and analyzing interior-point methods; previous research interests include homotopy methods, probabilistic analysis of pivoting methods, and extensions of complementary pivoting ideas to oriented matroids.\u003Cbr \/\u003E\u003Cbr \/\u003EAmong his several awards, he has received the George B. Dantzig Prize jointly from the Mathematical Programming Society and SIAM in 1988, and the John von Neumann Theory Prize from INFORMS in 2003.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":[{"value":"\u003Cp\u003EWe discuss the convergence properties of first-order methods for two problems that arise in computational geometry and statistics: the minimum-volume enclosing ellipsoid problem and the minimum-area enclosing ellipsoidal cylinder problem for a set of m points in R^n. The algorithms are old but the analysis is new, and the methods are remarkably effective at solving large-scale problems to high accuracy.\u003C\/p\u003E","format":"limited_html"}],"field_summary_sentence":[{"value":"Linear convergence of modified Frank-Wolfe algorithms for ellipsoid optimization algorithms"}],"uid":"27215","created_gmt":"2012-12-20 16:17:06","changed_gmt":"2016-10-08 02:01:40","author":"Mike Alberghini","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2009-09-22T12:00:00-04:00","event_time_end":"2009-09-22T13:00:00-04:00","event_time_end_last":"2009-09-22T13:00:00-04:00","gmt_time_start":"2009-09-22 16:00:00","gmt_time_end":"2009-09-22 17:00:00","gmt_time_end_last":"2009-09-22 17:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"1242","name":"School of Industrial and Systems Engineering (ISYE)"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003E\u003Cspan\u003ERenato Monteiro, ISyE\u003C\/span\u003E\u003Cbr \/\u003E\u003Ca href=\u0022http:\/\/www.gatech.edu\/contact\/?id=e4930\u0022\u003EContact Renato Monteiro\u003C\/a\u003E\u003Cbr \/\u003E\u003Cspan\u003E404-894-2300\u003C\/span\u003E\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}