{"id":1223,"date":"2023-07-26T11:59:22","date_gmt":"2023-07-26T11:59:22","guid":{"rendered":"https:\/\/www.sas-lab.deib.polimi.it\/?p=1223"},"modified":"2023-07-26T14:39:29","modified_gmt":"2023-07-26T14:39:29","slug":"data-driven-optimization-techniques-2","status":"publish","type":"post","link":"https:\/\/www.sas-lab.deib.polimi.it\/?p=1223","title":{"rendered":"Data-Driven Optimization Techniques"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\n\t\t
\n\n\t\t\t\t\t\t\t\t

\n\t\t\t\t\t\t\t\t\n\t\t\t\tData-Driven Optimization Techniques \n\t\t\t<\/h2 > \n\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

In many scientific, engineering, and industrial contexts, we are faced with optimization problems where the objective function and constraints (if present) are not given via closed-form mathematical expressions, i.e., they are\u00a0black-box<\/i>. Instead, they are only accessible by running expensive evaluations, e.g., experiments and\/or simulations. These problems arise in applications such as complex systems design, and control, where the target systems contain different and interacting physical mechanisms (electrical, mechanical, biological, analog\/digital interfaces, etc.). To find the best (feasible) solution to this class of optimization problems, existing approaches try to trade off between\u00a0exploitation\u00a0<\/i>(using information on the current best to improve on it), and\u00a0exploration\u00a0<\/i>(acquiring information around the search space to find better solutions). In the recent years, there has been a rise of model-based approaches in which a surrogate model is built from the samples taken so far, which is then used to choose the next sampling point. However, the most popular methods in the state-of-the-art are still faced with practical problems such as iteration-based optimization performance and computational burden.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t

\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t\t
\"Set<\/figure><\/div>
\"Evolution<\/figure><\/div>
\"Samples<\/figure><\/div>\t\t\t<\/div>\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t
<\/div>\n\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

At SAS-Lab, we conduct research on black-box (otherwise referred as\u00a0global<\/i>\u00a0or\u00a0data-driven<\/i>) optimization techniques which are iteration-efficient, and computationally light. We use Set Membership approaches to build a simple surrogate model of the underlying objective and constraint functions, and formulate an algorithm that automatically trades-off between exploitation, exploration, and safety with respect to constraint\/s satisfaction. This has resulted in the Set Membership Global Optimization (SMGO), with competitive iteration-based optimization performance, guaranteed convergence properties, and much lighter computational burden compared to the state of the art. SMGO has been used in challenging case studies, and is available as an\u00a0open-source toolbox<\/u><\/span><\/a>\u00a0in MATLAB File Exchange.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

References<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t
\n\t\t\t\t\t\t\t
<\/a><\/form>

Sorry, no publications matched your criteria.<\/p><\/div><\/div><\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

Simultaneous learning and optimization for problems with black-box objectives and constraints.<\/p>\n

Read more<\/a><\/p>","protected":false},"author":7,"featured_media":1222,"comment_status":"open","ping_status":"open","sticky":false,"template":"elementor_header_footer","format":"standard","meta":{"footnotes":""},"categories":[9],"tags":[],"class_list":{"0":"post-1223","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-research-topic"},"_links":{"self":[{"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=\/wp\/v2\/posts\/1223","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1223"}],"version-history":[{"count":13,"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=\/wp\/v2\/posts\/1223\/revisions"}],"predecessor-version":[{"id":1238,"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=\/wp\/v2\/posts\/1223\/revisions\/1238"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=\/wp\/v2\/media\/1222"}],"wp:attachment":[{"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1223"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1223"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.sas-lab.deib.polimi.it\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1223"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}