{"id":1996,"global_id":"datascience.unifi.it?id=1996","global_id_lineage":["datascience.unifi.it?id=1996"],"author":"4","status":"publish","date":"2019-09-27 12:13:56","date_utc":"2019-09-27 10:13:56","modified":"2019-09-27 12:22:25","modified_utc":"2019-09-27 10:22:25","url":"https:\/\/datascience.unifi.it\/index.php\/event\/seminar-complexity-of-nonconvex-optimization\/","rest_url":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/tribe\/events\/v1\/events\/1996","title":"Seminar: Complexity of nonconvex optimization","description":"<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>","excerpt":"","slug":"seminar-complexity-of-nonconvex-optimization","image":false,"all_day":false,"start_date":"2019-10-04 11:30:00","start_date_details":{"year":"2019","month":"10","day":"04","hour":"11","minutes":"30","seconds":"00"},"end_date":"2019-10-04 13:00:00","end_date_details":{"year":"2019","month":"10","day":"04","hour":"13","minutes":"00","seconds":"00"},"utc_start_date":"2019-10-04 09:30:00","utc_start_date_details":{"year":"2019","month":"10","day":"04","hour":"09","minutes":"30","seconds":"00"},"utc_end_date":"2019-10-04 11:00:00","utc_end_date_details":{"year":"2019","month":"10","day":"04","hour":"11","minutes":"00","seconds":"00"},"timezone":"Europe\/Rome","timezone_abbr":"CEST","cost":"","cost_details":{"currency_symbol":"","currency_code":"","currency_position":"prefix","values":[]},"website":"","show_map":true,"show_map_link":true,"hide_from_listings":false,"sticky":false,"featured":false,"categories":[{"name":"Seminar","slug":"seminar","term_group":0,"term_taxonomy_id":35,"taxonomy":"tribe_events_cat","description":"","parent":0,"count":97,"filter":"raw","id":35,"urls":{"self":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/tribe\/events\/v1\/categories\/35","collection":"https:\/\/datascience.unifi.it\/index.php\/wp-json\/tribe\/events\/v1\/categories"}}],"tags":[],"venue":{"id":1999,"author":"4","status":"publish","date":"2019-09-27 12:13:56","date_utc":"2019-09-27 10:13:56","modified":"2019-09-27 12:20:49","modified_utc":"2019-09-27 10:20:49","url":"https:\/\/datascience.unifi.it\/index.php\/venue\/plesso-didattico-morgagni\/","venue":"Plesso didattico Morgagni","slug":"plesso-didattico-morgagni","address":"Viale Morgani 40","city":"Firenze","country":"Italy","zip":"50134","json_ld":{"@type":"Place","name":"Plesso didattico Morgagni","description":"","url":"","address":{"@type":"PostalAddress","streetAddress":"Viale Morgani 40","addressLocality":"Firenze","postalCode":"50134","addressCountry":"Italy"},"telephone":"","sameAs":""},"show_map":true,"show_map_link":true,"global_id":"datascience.unifi.it?id=1999","global_id_lineage":["datascience.unifi.it?id=1999"]},"organizer":[],"custom_fields":[],"json_ld":{"@context":"http:\/\/schema.org","@type":"Event","name":"Seminar: Complexity of nonconvex optimization","description":"&lt;p&gt;Seminar @Dipartimento di Ingegneria Industriale Room 108 - Plesso didattico Morgagni Philippe Toint (University of Namur) Complexity of nonconvex optimization Abstract. We present a review of results on the worst-case ...&lt;\/p&gt;\\n","url":"https:\/\/datascience.unifi.it\/index.php\/event\/seminar-complexity-of-nonconvex-optimization\/","eventAttendanceMode":"https:\/\/schema.org\/OfflineEventAttendanceMode","eventStatus":"https:\/\/schema.org\/EventScheduled","startDate":"2019-10-04T11:30:00+02:00","endDate":"2019-10-04T13:00:00+02:00","location":{"@type":"Place","name":"Plesso didattico Morgagni","description":"","url":"","address":{"@type":"PostalAddress","streetAddress":"Viale Morgani 40","addressLocality":"Firenze","postalCode":"50134","addressCountry":"Italy"},"telephone":"","sameAs":""},"performer":"Organization"}}