Model-Free $μ$-Synthesis: A Nonsmooth Optimization Perspective Article Swipe
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2402.11654
In this paper, we revisit model-free policy search on an important robust control benchmark, namely $μ$-synthesis. In the general output-feedback setting, there do not exist convex formulations for this problem, and hence global optimality guarantees are not expected. Apkarian (2011) presented a nonconvex nonsmooth policy optimization approach for this problem, and achieved state-of-the-art design results via using subgradient-based policy search algorithms which generate update directions in a model-based manner. Despite the lack of convexity and global optimality guarantees, these subgradient-based policy search methods have led to impressive numerical results in practice. Built upon such a policy optimization persepctive, our paper extends these subgradient-based search methods to a model-free setting. Specifically, we examine the effectiveness of two model-free policy optimization strategies: the model-free non-derivative sampling method and the zeroth-order policy search with uniform smoothing. We performed an extensive numerical study to demonstrate that both methods consistently replicate the design outcomes achieved by their model-based counterparts. Additionally, we provide some theoretical justifications showing that convergence guarantees to stationary points can be established for our model-free $μ$-synthesis under some assumptions related to the coerciveness of the cost function. Overall, our results demonstrate that derivative-free policy optimization offers a competitive and viable approach for solving general output-feedback $μ$-synthesis problems in the model-free setting.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2402.11654
- https://arxiv.org/pdf/2402.11654
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4391984881
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4391984881Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2402.11654Digital Object Identifier
- Title
-
Model-Free $μ$-Synthesis: A Nonsmooth Optimization PerspectiveWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-02-18Full publication date if available
- Authors
-
Darioush Keivan, Xingang Guo, Peter Seiler, Geir E. Dullerud, Bin HuList of authors in order
- Landing page
-
https://arxiv.org/abs/2402.11654Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2402.11654Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2402.11654Direct OA link when available
- Concepts
-
Perspective (graphical), Computer science, Mathematical economics, Mathematical optimization, Mathematics, Artificial intelligenceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4391984881 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2402.11654 |
| ids.doi | https://doi.org/10.48550/arxiv.2402.11654 |
| ids.openalex | https://openalex.org/W4391984881 |
| fwci | |
| type | preprint |
| title | Model-Free $μ$-Synthesis: A Nonsmooth Optimization Perspective |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T11195 |
| topics[0].field.id | https://openalex.org/fields/18 |
| topics[0].field.display_name | Decision Sciences |
| topics[0].score | 0.1907999962568283 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1803 |
| topics[0].subfield.display_name | Management Science and Operations Research |
| topics[0].display_name | Simulation Techniques and Applications |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C12713177 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7217229008674622 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1900281 |
| concepts[0].display_name | Perspective (graphical) |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.4061618447303772 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C144237770 |
| concepts[2].level | 1 |
| concepts[2].score | 0.3724033236503601 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q747534 |
| concepts[2].display_name | Mathematical economics |
| concepts[3].id | https://openalex.org/C126255220 |
| concepts[3].level | 1 |
| concepts[3].score | 0.3643344044685364 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[3].display_name | Mathematical optimization |
| concepts[4].id | https://openalex.org/C33923547 |
| concepts[4].level | 0 |
| concepts[4].score | 0.30943626165390015 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[4].display_name | Mathematics |
| concepts[5].id | https://openalex.org/C154945302 |
| concepts[5].level | 1 |
| concepts[5].score | 0.16508063673973083 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[5].display_name | Artificial intelligence |
| keywords[0].id | https://openalex.org/keywords/perspective |
| keywords[0].score | 0.7217229008674622 |
| keywords[0].display_name | Perspective (graphical) |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.4061618447303772 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/mathematical-economics |
| keywords[2].score | 0.3724033236503601 |
| keywords[2].display_name | Mathematical economics |
| keywords[3].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[3].score | 0.3643344044685364 |
| keywords[3].display_name | Mathematical optimization |
| keywords[4].id | https://openalex.org/keywords/mathematics |
| keywords[4].score | 0.30943626165390015 |
| keywords[4].display_name | Mathematics |
| keywords[5].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[5].score | 0.16508063673973083 |
| keywords[5].display_name | Artificial intelligence |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2402.11654 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2402.11654 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2402.11654 |
| locations[1].id | doi:10.48550/arxiv.2402.11654 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2402.11654 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5080871366 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Darioush Keivan |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Keivan, Darioush |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5101652354 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-7169-9053 |
| authorships[1].author.display_name | Xingang Guo |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Guo, Xingang |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5009028512 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-3423-1109 |
| authorships[2].author.display_name | Peter Seiler |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Seiler, Peter |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5061952552 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-0596-6050 |
| authorships[3].author.display_name | Geir E. Dullerud |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Dullerud, Geir |
| authorships[3].is_corresponding | False |
| authorships[4].author.id | https://openalex.org/A5101513622 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-5632-7737 |
| authorships[4].author.display_name | Bin Hu |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Hu, Bin |
| authorships[4].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2402.11654 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Model-Free $μ$-Synthesis: A Nonsmooth Optimization Perspective |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T11195 |
| primary_topic.field.id | https://openalex.org/fields/18 |
| primary_topic.field.display_name | Decision Sciences |
| primary_topic.score | 0.1907999962568283 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1803 |
| primary_topic.subfield.display_name | Management Science and Operations Research |
| primary_topic.display_name | Simulation Techniques and Applications |
| related_works | https://openalex.org/W2748952813, https://openalex.org/W1979597421, https://openalex.org/W2007980826, https://openalex.org/W4245490552, https://openalex.org/W2061531152, https://openalex.org/W3002753104, https://openalex.org/W2077600819, https://openalex.org/W1587224694, https://openalex.org/W2042127053, https://openalex.org/W2142036596 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2402.11654 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2402.11654 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2402.11654 |
| primary_location.id | pmh:oai:arXiv.org:2402.11654 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2402.11654 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2402.11654 |
| publication_date | 2024-02-18 |
| publication_year | 2024 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 41, 66, 94, 106, 194 |
| abstract_inverted_index.In | 0, 16 |
| abstract_inverted_index.We | 133 |
| abstract_inverted_index.an | 9, 135 |
| abstract_inverted_index.be | 168 |
| abstract_inverted_index.by | 150 |
| abstract_inverted_index.do | 22 |
| abstract_inverted_index.in | 65, 89, 205 |
| abstract_inverted_index.of | 72, 114, 181 |
| abstract_inverted_index.on | 8 |
| abstract_inverted_index.to | 85, 105, 139, 164, 178 |
| abstract_inverted_index.we | 3, 110, 155 |
| abstract_inverted_index.and | 30, 50, 74, 125, 196 |
| abstract_inverted_index.are | 35 |
| abstract_inverted_index.can | 167 |
| abstract_inverted_index.for | 27, 47, 170, 199 |
| abstract_inverted_index.led | 84 |
| abstract_inverted_index.not | 23, 36 |
| abstract_inverted_index.our | 98, 171, 186 |
| abstract_inverted_index.the | 17, 70, 112, 120, 126, 146, 179, 182, 206 |
| abstract_inverted_index.two | 115 |
| abstract_inverted_index.via | 55 |
| abstract_inverted_index.both | 142 |
| abstract_inverted_index.cost | 183 |
| abstract_inverted_index.have | 83 |
| abstract_inverted_index.lack | 71 |
| abstract_inverted_index.some | 157, 175 |
| abstract_inverted_index.such | 93 |
| abstract_inverted_index.that | 141, 161, 189 |
| abstract_inverted_index.this | 1, 28, 48 |
| abstract_inverted_index.upon | 92 |
| abstract_inverted_index.with | 130 |
| abstract_inverted_index.Built | 91 |
| abstract_inverted_index.exist | 24 |
| abstract_inverted_index.hence | 31 |
| abstract_inverted_index.paper | 99 |
| abstract_inverted_index.study | 138 |
| abstract_inverted_index.their | 151 |
| abstract_inverted_index.there | 21 |
| abstract_inverted_index.these | 78, 101 |
| abstract_inverted_index.under | 174 |
| abstract_inverted_index.using | 56 |
| abstract_inverted_index.which | 61 |
| abstract_inverted_index.(2011) | 39 |
| abstract_inverted_index.convex | 25 |
| abstract_inverted_index.design | 53, 147 |
| abstract_inverted_index.global | 32, 75 |
| abstract_inverted_index.method | 124 |
| abstract_inverted_index.namely | 14 |
| abstract_inverted_index.offers | 193 |
| abstract_inverted_index.paper, | 2 |
| abstract_inverted_index.points | 166 |
| abstract_inverted_index.policy | 6, 44, 58, 80, 95, 117, 128, 191 |
| abstract_inverted_index.robust | 11 |
| abstract_inverted_index.search | 7, 59, 81, 103, 129 |
| abstract_inverted_index.update | 63 |
| abstract_inverted_index.viable | 197 |
| abstract_inverted_index.Despite | 69 |
| abstract_inverted_index.control | 12 |
| abstract_inverted_index.examine | 111 |
| abstract_inverted_index.extends | 100 |
| abstract_inverted_index.general | 18, 201 |
| abstract_inverted_index.manner. | 68 |
| abstract_inverted_index.methods | 82, 104, 143 |
| abstract_inverted_index.provide | 156 |
| abstract_inverted_index.related | 177 |
| abstract_inverted_index.results | 54, 88, 187 |
| abstract_inverted_index.revisit | 4 |
| abstract_inverted_index.showing | 160 |
| abstract_inverted_index.solving | 200 |
| abstract_inverted_index.uniform | 131 |
| abstract_inverted_index.Apkarian | 38 |
| abstract_inverted_index.Overall, | 185 |
| abstract_inverted_index.achieved | 51, 149 |
| abstract_inverted_index.approach | 46, 198 |
| abstract_inverted_index.generate | 62 |
| abstract_inverted_index.outcomes | 148 |
| abstract_inverted_index.problem, | 29, 49 |
| abstract_inverted_index.problems | 204 |
| abstract_inverted_index.sampling | 123 |
| abstract_inverted_index.setting, | 20 |
| abstract_inverted_index.setting. | 108, 208 |
| abstract_inverted_index.convexity | 73 |
| abstract_inverted_index.expected. | 37 |
| abstract_inverted_index.extensive | 136 |
| abstract_inverted_index.function. | 184 |
| abstract_inverted_index.important | 10 |
| abstract_inverted_index.nonconvex | 42 |
| abstract_inverted_index.nonsmooth | 43 |
| abstract_inverted_index.numerical | 87, 137 |
| abstract_inverted_index.performed | 134 |
| abstract_inverted_index.practice. | 90 |
| abstract_inverted_index.presented | 40 |
| abstract_inverted_index.replicate | 145 |
| abstract_inverted_index.algorithms | 60 |
| abstract_inverted_index.benchmark, | 13 |
| abstract_inverted_index.directions | 64 |
| abstract_inverted_index.guarantees | 34, 163 |
| abstract_inverted_index.impressive | 86 |
| abstract_inverted_index.model-free | 5, 107, 116, 121, 172, 207 |
| abstract_inverted_index.optimality | 33, 76 |
| abstract_inverted_index.smoothing. | 132 |
| abstract_inverted_index.stationary | 165 |
| abstract_inverted_index.assumptions | 176 |
| abstract_inverted_index.competitive | 195 |
| abstract_inverted_index.convergence | 162 |
| abstract_inverted_index.demonstrate | 140, 188 |
| abstract_inverted_index.established | 169 |
| abstract_inverted_index.guarantees, | 77 |
| abstract_inverted_index.model-based | 67, 152 |
| abstract_inverted_index.strategies: | 119 |
| abstract_inverted_index.theoretical | 158 |
| abstract_inverted_index.coerciveness | 180 |
| abstract_inverted_index.consistently | 144 |
| abstract_inverted_index.formulations | 26 |
| abstract_inverted_index.optimization | 45, 96, 118, 192 |
| abstract_inverted_index.persepctive, | 97 |
| abstract_inverted_index.zeroth-order | 127 |
| abstract_inverted_index.Additionally, | 154 |
| abstract_inverted_index.Specifically, | 109 |
| abstract_inverted_index.counterparts. | 153 |
| abstract_inverted_index.effectiveness | 113 |
| abstract_inverted_index.$μ$-synthesis | 173, 203 |
| abstract_inverted_index.justifications | 159 |
| abstract_inverted_index.non-derivative | 122 |
| abstract_inverted_index.$μ$-synthesis. | 15 |
| abstract_inverted_index.derivative-free | 190 |
| abstract_inverted_index.output-feedback | 19, 202 |
| abstract_inverted_index.state-of-the-art | 52 |
| abstract_inverted_index.subgradient-based | 57, 79, 102 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile |