{"id":"https://openalex.org/W1500172981","doi":"https://doi.org/10.1109/cacsd.2010.5612656","title":"On the complexity of randomized approximations of nonconvex sets","display_name":"On the complexity of randomized approximations of nonconvex sets","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W1500172981","doi":"https://doi.org/10.1109/cacsd.2010.5612656","mag":"1500172981"},"language":"en","primary_location":{"id":"doi:10.1109/cacsd.2010.5612656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacsd.2010.5612656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Computer-Aided Control System Design","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078379817","display_name":"Fabrizio Dabbene","orcid":"https://orcid.org/0000-0002-2258-8971"},"institutions":[{"id":"https://openalex.org/I4210100607","display_name":"Institute of Electronics, Computer and Telecommunication Engineering","ror":"https://ror.org/00n4jbh84","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210100607","https://openalex.org/I4210155236"]},{"id":"https://openalex.org/I4210130157","display_name":"Institute of Informatics and Telematics","ror":"https://ror.org/02gdcn153","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210130157","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabrizio Dabbene","raw_affiliation_strings":["IEIIT CNR, Italy","IEIIT-CNR, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IEIIT CNR, Italy","institution_ids":["https://openalex.org/I4210100607","https://openalex.org/I4210130157"]},{"raw_affiliation_string":"IEIIT-CNR, Italy","institution_ids":["https://openalex.org/I4210100607","https://openalex.org/I4210130157"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035668981","display_name":"Constantino Lagoa","orcid":"https://orcid.org/0000-0001-6871-3240"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Constantino Lagoa","raw_affiliation_strings":["Pennslyvania State University, USA","[Penn State University, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennslyvania State University, USA","institution_ids":[]},{"raw_affiliation_string":"[Penn State University, USA]","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030456599","display_name":"Pavel Shcherbakov","orcid":"https://orcid.org/0000-0002-4033-2507"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pavel Shcherbakov","raw_affiliation_strings":["Institute of Control Science, Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Control Science, Moscow, Russia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0127,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.72920934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"46","issue":null,"first_page":"1564","last_page":"1569"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6456004977226257},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.6131591796875},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5786814093589783},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5747181177139282},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5593652725219727},{"id":"https://openalex.org/keywords/probability-measure","display_name":"Probability measure","score":0.5297219157218933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5071663856506348},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.4665021300315857},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4442824423313141},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4397073984146118},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4312683939933777},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4305146336555481},{"id":"https://openalex.org/keywords/approximations-of-\u03c0","display_name":"Approximations of \u03c0","score":0.4174426198005676},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36968880891799927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.360478937625885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3495325446128845},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3365052342414856},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0992821455001831},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09240445494651794}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6456004977226257},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.6131591796875},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5786814093589783},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5747181177139282},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5593652725219727},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.5297219157218933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5071663856506348},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.4665021300315857},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4442824423313141},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4397073984146118},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4312683939933777},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4305146336555481},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.4174426198005676},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36968880891799927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.360478937625885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3495325446128845},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3365052342414856},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0992821455001831},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09240445494651794},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cacsd.2010.5612656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacsd.2010.5612656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Computer-Aided Control System Design","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W49971397","https://openalex.org/W184267688","https://openalex.org/W191379354","https://openalex.org/W1519840209","https://openalex.org/W1632601927","https://openalex.org/W1726255445","https://openalex.org/W1976130352","https://openalex.org/W2000067452","https://openalex.org/W2004959978","https://openalex.org/W2016660844","https://openalex.org/W2019476477","https://openalex.org/W2103385470","https://openalex.org/W2112015490","https://openalex.org/W2116364955","https://openalex.org/W2121993042","https://openalex.org/W2137562896","https://openalex.org/W2154904851","https://openalex.org/W2161362637","https://openalex.org/W2170398694","https://openalex.org/W4253160836","https://openalex.org/W4294968333","https://openalex.org/W4301075635","https://openalex.org/W6650486461","https://openalex.org/W6651414310","https://openalex.org/W6677748928"],"related_works":["https://openalex.org/W2163115662","https://openalex.org/W2888826740","https://openalex.org/W2463505734","https://openalex.org/W2005018956","https://openalex.org/W2099734427","https://openalex.org/W4388968519","https://openalex.org/W2521479096","https://openalex.org/W2035994564","https://openalex.org/W4293997817","https://openalex.org/W2244037217"],"abstract_inverted_index":{"We":[0],"consider":[1,86],"a":[2,9,47,67,205],"nonconvex":[3],"set":[4,34,92],"\u03ba":[5,42,52,78],"\u2208":[6,27,36],"\u211dnendowed":[7],"with":[8,72,148,190],"probability":[10,45,74],"measure":[11,22],"P,":[12],"and":[13,53,97,99,143,187,202,225],"assume":[14],"that":[15,32,66],"random":[16],"samples":[17,128],"taken":[18],"according":[19],"to":[20,49,51,55,150,171],"this":[21,62,198,213],"are":[23,194],"available.":[24],"For":[25],"\u03b5":[26],"(0;":[28],"1),":[29],"we":[30,64,85,112],"say":[31],"the":[33,44,91,117,125,131,139,151,155,167,172,182,209,216,219,226],"A":[35,56],"\u211dnis":[37],"an":[38],"\u03b5-probabilistic":[39],"approximation":[40],"of":[41,46,77,119,124,127,141,157,166,174,197,218,222,229],"if":[43],"point":[48],"belong":[50],"not":[54],"is":[57,169,215],"less":[58],"than":[59],"\u03b5.":[60],"In":[61,83],"paper,":[63],"show":[65,100],"simple":[68],"randomized":[69],"algorithm":[70],"returning":[71],"high":[73],"convex":[75],"\u03b5-approximations":[76],"can":[79,108],"be":[80,109],"easily":[81],"devised.":[82],"particular,":[84],"different":[87,132],"possible":[88],"shapes":[89,107],"for":[90,208],"A,":[93],"namely":[94],"ellipsoids,":[95],"hyperrectangles,":[96],"parallelotopes,":[98],"how":[101],"specific":[102,206],"approximations":[103,145],"based":[104,177],"on":[105,116,178,181],"such":[106,120],"constructed.":[110],"Moreover,":[111],"derive":[113],"explicit":[114],"bounds":[115],"complexity":[118,140],"approximations,":[121,176],"in":[122,130,154,200,212],"terms":[123],"number":[126],"needed":[129],"cases.":[133],"It":[134],"turns":[135],"out":[136],"that,":[137],"while":[138],"ellipsoidal":[142],"parallelotopic":[144],"grow":[146],"quadratically":[147],"respect":[149],"dimension":[152],"n,":[153],"case":[156],"orthotopes":[158],"one":[159],"obtains":[160],"linear":[161],"dependence.":[162],"The":[163],"second":[164],"part":[165],"paper":[168,214],"devoted":[170],"study":[173],"tighter":[175],"recent":[179],"results":[180],"connection":[183],"between":[184],"chance-constrained":[185],"problems":[186,189],"scenario":[188],"discarded":[191],"constraints.":[192],"There":[193],"numerous":[195],"applications":[196],"result":[199],"systems":[201],"control":[203],"theory;":[204],"motivation":[207],"research":[210],"conducted":[211],"characterization":[217],"reachable":[220],"sets":[221],"nonlinear":[223,230],"systems,":[224],"related":[227],"problem":[228],"filtering.":[231]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}