{"603380":{"#nid":"603380","#data":{"type":"event","title":"ISyE Seminar - Georgina Hall","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ETITLE:\u0026nbsp;\u003C\/strong\u003ELP, SOCP, and optimization-free approaches to sum of squares optimization\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EABSTRACT: \u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003EThe problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, machine learning, game theory, and combinatorics, among others. A number of breakthrough papers in the early 2000s showed that this problem, long thought to be intractable, could be solved by using sum of squares programming. This technique however has proved to be expensive for large-scale problems, as it involves solving large semidefinite programs (SDPs).\u003Cbr \/\u003E\r\n\u003Cbr \/\u003E\r\nIn the first part of this talk, we present two methods for approximately solving large-scale sum of squares programs that dispense altogether with semidefinite programming and only involve solving a sequence of linear or second order cone programs generated in an adaptive fashion. In the second part of the talk, we focus on the problem of finding tight lower bounds on polynomial optimization problems (POPs), a fundamental task in this area that is most commonly handled through the use of SDP-based sum of squares hierarchies (e.g., due to Lasserre and Parrilo). In contrast to previous approaches, we provide the first theoretical framework for efficiently constructing converging hierarchies of lower bounds on POPs whose computation does not require any optimization, but simply the ability to multiply certain fixed polynomials together and check nonnegativity of the coefficients of the product.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EBIO:\u003C\/strong\u003E Georgina Hall is a final-year PhD student and a\u0026nbsp;\u003Ca href=\u0022http:\/\/giving.princeton.edu\/scholarships-fellowships\/fellowships\/endowed2#w\u0022\u003EGordon Y. S. Wu fellow\u003C\/a\u003E\u0026nbsp;in the department of \u003Ca href=\u0022http:\/\/orfe.princeton.edu\/\u0022\u003EOperations Research and Financial Engineering\u003C\/a\u003E\u0026nbsp;at Princeton University.\u0026nbsp;Her advisor is\u0026nbsp;\u003Ca href=\u0022http:\/\/aaa.princeton.edu\/\u0022\u003EProf. Amir Ali Ahmadi\u003C\/a\u003E. She received her Bachelor of Science from \u003Ca href=\u0022http:\/\/www.ecp.fr\/\u0022\u003EEcole Centrale Paris\u003C\/a\u003E, France, in 2011 and her Master of Science from the same university in 2013.\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"ISyE Seminar - Georgina Hall"}],"uid":"34547","created_gmt":"2018-03-06 18:25:38","changed_gmt":"2018-03-06 18:25:38","author":"nhendricks6","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2018-03-07T11:00:00-05:00","event_time_end":"2018-03-07T12:00:00-05:00","event_time_end_last":"2018-03-07T12:00:00-05:00","gmt_time_start":"2018-03-07 16:00:00","gmt_time_end":"2018-03-07 17:00:00","gmt_time_end_last":"2018-03-07 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":[],"invited_audience":[{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"78751","name":"Undergraduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}