{"id":1005,"date":"2025-02-23T17:48:10","date_gmt":"2025-02-23T17:48:10","guid":{"rendered":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/?page_id=1005"},"modified":"2025-03-13T16:29:25","modified_gmt":"2025-03-13T16:29:25","slug":"europtschool25","status":"publish","type":"page","link":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/europtschool25\/","title":{"rendered":"EUROPT Summer School 2025"},"content":{"rendered":"

[vc_row][vc_column][vc_column_text css=””]<\/p>\r\n

School dates, venue and topics<\/span><\/h1>\r\n

The school\u00a0 will take place on 27-29\u00a0 June <\/span><\/strong>at the University of Southampton, England, UK. The school is planned to be in-person only, no live streaming will be provided<\/em>.<\/span> There will be two courses<\/em> focusing on different sides of the continuous optimization world, specifically on<\/p>\r\n

1. Distributionally robust optimization<\/span><\/h3>\r\n

\u00a02. Error bounds in optimization<\/span><\/h3>\r\n

The lectures on robustness will be delivered by Daniel Kuhn<\/span>, on error bounds by Anthony Man-Cho So<\/span>. The first two days will included about 6 hours of lectures plus coffee breaks. An excursion to Winchester is planned for Sunday 29.<\/p>\r\n

Attendance\u00a0<\/span><\/h1>\r\n

Attendance is free of charge <\/em>but with a mandatory registration<\/em>. Lectures are particularly suited for PhD students and young researchers<\/em> to provide them with the chance of\u00a0 attending two high level courses on continuous optimization, but\u00a0 the school is open to everyone<\/em> wishing to participate. To register fill this form<\/strong><\/a> by 5 May (please, register only when you are sure you are coming: the available classroom is large, so everyone should have a place – in the very unlikely event of too many registrations\u00a0 the priority will not be set upon early booking).<\/p>\r\n

Timetable\u00a0<\/span><\/h1>\r\n

Friday 27 June<\/em> – Daniel Kuhn<\/p>\r\n

Saturday 28 June<\/em> – Anthony Man-Cho So<\/p>\r\n

9:00 – 10:30 Lecture I<\/p>\r\n

10:30 – 11:00 Coffee break<\/p>\r\n

11:00 – 12:30 Lecture II<\/p>\r\n

12:30 – 14:00 Lunch break<\/p>\r\n

14:00 – 15:30 Lecture III<\/p>\r\n

15:30 – 16:00 Coffee break<\/p>\r\n

16:00 – 17:30 Lecture IV\/Discussion<\/p>\r\n

Sunday 29 June<\/em> – Excursion to Winchester<\/p>\r\n

The courses<\/span><\/h1>\r\n

Distributionally Robust Optimization<\/span><\/h2>\r\n

by\u00a0 Daniel Kuhn<\/h3>\r\n

Distributionally robust optimization (DRO) studies decision problems under uncertainty where the probability distribution governing the uncertain problem parameters is itself uncertain. A key component of any DRO model is its ambiguity set, that is, a family of probability distributions consistent with any available structural or statistical information. DRO seeks decisions that perform best under the worst distribution in the ambiguity set. This worst case criterion is supported by findings in psychology and neuroscience, which indicate that many decision-makers have a low tolerance for distributional ambiguity. DRO is rooted in statistics, operations research and control theory, and recent research has uncovered its deep connections to regularization techniques and adversarial training in machine learning. This course will present the key findings of the field in a unified and self-contained manner.
<\/span><\/p>\r\n

\u00a0Error Bounds in Optimization<\/span><\/h2>\r\n

by\u00a0 Anthony Man-Cho So<\/h3>\r\n

Many contemporary applications in science and engineering give rise to optimization problems that have specific structures, and it is often observed numerically that various iterative methods for solving these structured problems enjoy fast convergence rates. Can we theoretically show that these methods are able to exploit problem structures to achieve fast convergence? To address this question, a powerful approach is to examine the problem structure through the lens of error bounds or the Kurdyka-Lojasiewicz (KL) inequality. Roughly speaking, an error bound provides an estimate of the distance to the solution set of a problem, while the KL inequality provides an estimate of the growth of the objective function of a problem. These estimates yield information on how the iterates generated by different methods progress, thereby allowing one to study the convergence behavior of these methods. In this course, we first introduce the error bound-based and KL inequality-based frameworks for convergence rate analysis of iterative methods. Then, we showcase a number of application scenarios of these frameworks. The scenarios are drawn from applications in computational economics, machine learning, signal processing, and statistics, so as to demonstrate the wide applicability of the said frameworks. Lastly, we discuss the interplay between error bounds and the KL inequality, which offers further insights into how these two tools capture the structure of an optimization problem.<\/p>\r\n

The lecturers<\/span><\/h1>\r\n

Daniel Kuhn (\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne)<\/h2>\r\n\r\n
\"\"<\/figure>\r\n
Daniel Kuhn is a Professor of Operations Research in the College of Management of Technology at EPFL, where he holds the Chair of Risk Analytics and Optimization. His research interests revolve around optimization under uncertainty. Before joining EPFL, Daniel Kuhn was a faculty member in the Department of Computing at Imperial College London and a postdoctoral researcher in the Department of Management Science and Engineering at Stanford University. He holds a PhD degree in Economics from the University of St. Gallen and an MSc degree in Theoretical Physics from ETH Zurich. He is an INFORMS fellow and the recipient of several research and teaching prizes including the Friedrich Wilhelm Bessel Research Award by the Alexander von Humboldt Foundation as well as the Frederick W. Lanchester Prize and the Farkas Prize by INFORMS. He has been elected EUROPT Fellow<\/a> in 2025. He is the editor-in-chief of Mathematical Programming.\u00a0<\/span><\/div>\r\n

Anthony Man-Cho So (The Chinese University of Hong Kong)<\/h2>\r\n\r\n
\"\"<\/figure>\r\n

Anthony Man-Cho So is currently Dean of the Graduate School, Deputy Master of Morningside College, and Professor in the Department of Systems Engineering and Engineering Management at The Chinese University of Hong Kong (CUHK). His research focuses on optimization theory and its applications in various areas of science and engineering, including computational geometry, machine learning, signal processing, and statistics.<\/p>\r\n

Dr. So is a Fellow of IEEE and a Fellow of the Hong Kong Institution of Engineers. He is the recipient of a number of research and teaching awards, including the 2024 INFORMS Computing Society Prize, the SIAM Review SIGEST Award in 2024, the 2018 IEEE Signal Processing Society Best Paper Award, the 2015 IEEE Signal Processing Society Signal Processing Magazine Best Paper Award, the 2014 IEEE Communications Society Asia-Pacific Outstanding Paper Award, and the 2010 INFORMS Optimization Society Optimization Prize for Young Researchers, as well as the 2022 UGC Teaching Award (General Faculty Members Category) of the University Grants Committee of Hong Kong. Dr. So currently serves on the editorial boards of Journal of Global Optimization, Mathematical Programming, Mathematics of Operations Research, Open Journal of Mathematical Optimization, and Optimization Methods and Software. He has also served as an associate editor of IEEE Transactions on Signal Processing and SIAM Journal on Optimization, as well as the Lead Guest Editor of IEEE Signal Processing Magazine Special Issue on Non-Convex Optimization for Signal Processing and Machine Learning.<\/p>\r\n

\u00a0<\/h1>\r\n

Organisation<\/span><\/h1>\r\n

\"\"\u00a0 \u00a0\"\"\u00a0 \u00a0 \u00a0 \"\"<\/p>\r\n\r\n

 <\/p>\r\n

[\/vc_column_text][\/vc_column][\/vc_row]<\/p><\/div>","protected":false},"excerpt":{"rendered":"

[vc_row][vc_column][vc_column_text css=””] School dates, venue and topics The school\u00a0 will take place on 27-29\u00a0 June at the University of Southampton, England, UK. The school is planned to be in-person only, […]<\/p>\n","protected":false},"author":10,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-1005","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/pages\/1005"}],"collection":[{"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/comments?post=1005"}],"version-history":[{"count":17,"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/pages\/1005\/revisions"}],"predecessor-version":[{"id":1029,"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/pages\/1005\/revisions\/1029"}],"wp:attachment":[{"href":"https:\/\/www.euro-online.org\/websites\/continuous-optimization\/wp-json\/wp\/v2\/media?parent=1005"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}