{"id":1996,"date":"2019-09-27T12:13:56","date_gmt":"2019-09-27T10:13:56","guid":{"rendered":"https:\/\/datascience.unifi.it\/?post_type=tribe_events&#038;p=1996"},"modified":"2019-09-27T12:22:25","modified_gmt":"2019-09-27T10:22:25","slug":"seminar-complexity-of-nonconvex-optimization","status":"publish","type":"tribe_events","link":"https:\/\/datascience.unifi.it\/index.php\/event\/seminar-complexity-of-nonconvex-optimization\/","title":{"rendered":"Seminar: Complexity of nonconvex optimization"},"content":{"rendered":"<p><strong>Seminar @Dipartimento di Ingegneria Industriale<\/strong><br \/>\nRoom 108 &#8211; Plesso didattico Morgagni<\/p>\n<p>Philippe Toint (University of Namur)<\/p>\n<p><strong>Complexity of nonconvex optimization<\/strong><\/p>\n<p>Abstract.<br \/>\nWe present a review of results on the worst-case complexity of minimization algorithms for nonconvex problems using potentially high-degree models.<br \/>\nGlobal complexity bound are presented that are valid for any model\u2019s degree and any order of optimality, thereby generalizing known results for first- and second-order methods. An adaptive regularization algorithm using derivatives up to degree p will produce an epsilon-approximate q-th order minimizer in at most O(epsilon^( -(p+1)\/(p\u2212q+1) ) evaluations. We will also extend these results to the case of inexact objective function and derivatives with an application to subsampling algorithms for machine learning.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Seminar @Dipartimento di Ingegneria Industriale Room 108 &#8211; Plesso didattico Morgagni Philippe Toint (University of Namur) Complexity of nonconvex optimization Abstract. We present a review of results on the worst-case &#8230;<\/p>\n","protected":false},"author":4,"featured_media":0,"template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_tribe_events_status":"","_tribe_events_status_reason":"","footnotes":""},"tags":[],"tribe_events_cat":[35],"class_list":["post-1996","tribe_events","type-tribe_events","status-publish","hentry","tribe_events_cat-seminar","cat_seminar"],"_links":{"self":[{"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/tribe_events\/1996","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/tribe_events"}],"about":[{"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/types\/tribe_events"}],"author":[{"embeddable":true,"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/users\/4"}],"version-history":[{"count":3,"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/tribe_events\/1996\/revisions"}],"predecessor-version":[{"id":2002,"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/tribe_events\/1996\/revisions\/2002"}],"wp:attachment":[{"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/media?parent=1996"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/tags?post=1996"},{"taxonomy":"tribe_events_cat","embeddable":true,"href":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/wp\/v2\/tribe_events_cat?post=1996"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}