{"id":"https://openalex.org/W2146616610","doi":"https://doi.org/10.1109/cdc.2010.5717086","title":"Random convex programs: Dealing with the non-existing solution nuisance","display_name":"Random convex programs: Dealing with the non-existing solution nuisance","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2146616610","doi":"https://doi.org/10.1109/cdc.2010.5717086","mag":"2146616610"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2010.5717086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2010.5717086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"49th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"article","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/A5041746196","display_name":"Giuseppe C. Calafiore","orcid":"https://orcid.org/0000-0002-6428-5653"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giuseppe Carlo Calafiore","raw_affiliation_strings":["Dipartimento di Automatica e Informatica, Politecnico di Turino, Italy","Dipartimento di Automatica e Informatica - Politecnico di Torino, ITALY#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Automatica e Informatica, Politecnico di Turino, Italy","institution_ids":["https://openalex.org/I177477856"]},{"raw_affiliation_string":"Dipartimento di Automatica e Informatica - Politecnico di Torino, ITALY#TAB#","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041746196"],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.2088747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"577","issue":null,"first_page":"1939","last_page":"1944"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9951000213623047,"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.9951000213623047,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6609167456626892},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6029454469680786},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5856547951698303},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.5612495541572571},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.5470467805862427},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5317510366439819},{"id":"https://openalex.org/keywords/multivariate-random-variable","display_name":"Multivariate random variable","score":0.5135376453399658},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5127094984054565},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5046588182449341},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5036126971244812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4964616894721985},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.49330416321754456},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.47728148102760315},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.41727009415626526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3704618215560913},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12705495953559875}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6609167456626892},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6029454469680786},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5856547951698303},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.5612495541572571},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.5470467805862427},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5317510366439819},{"id":"https://openalex.org/C138405894","wikidata":"https://www.wikidata.org/wiki/Q3179949","display_name":"Multivariate random variable","level":3,"score":0.5135376453399658},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5127094984054565},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5046588182449341},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5036126971244812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4964616894721985},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.49330416321754456},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.47728148102760315},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.41727009415626526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3704618215560913},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12705495953559875},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2010.5717086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2010.5717086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"49th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:porto.polito.it:2380898","is_oa":false,"landing_page_url":"http://porto.polito.it/2380898/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402038","display_name":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177477856","host_organization_name":"Politecnico di Torino","host_organization_lineage":["https://openalex.org/I177477856"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4300000071525574,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1789652828","https://openalex.org/W1976466849","https://openalex.org/W2008581147","https://openalex.org/W2010790640","https://openalex.org/W2028713840","https://openalex.org/W2096999004","https://openalex.org/W2117781171","https://openalex.org/W2125028780","https://openalex.org/W2150664153","https://openalex.org/W2167412190","https://openalex.org/W2908064020","https://openalex.org/W4249667877","https://openalex.org/W4294968333"],"related_works":["https://openalex.org/W2026600343","https://openalex.org/W2013655535","https://openalex.org/W4382519084","https://openalex.org/W2376997122","https://openalex.org/W2999421545","https://openalex.org/W1977643895","https://openalex.org/W2478309485","https://openalex.org/W2040676043","https://openalex.org/W2391091101","https://openalex.org/W4256242347"],"abstract_inverted_index":{"Random":[0],"convex":[1,5,61,85,117],"programs":[2,86],"(RCPs)":[3],"are":[4,16,39,88],"optimization":[6],"problems":[7],"subject":[8],"to":[9,21,90],"a":[10,64,70,80,111],"finite":[11],"number":[12],"of":[13,28,54,83],"constraints":[14],"that":[15,87],"extracted":[17],"at":[18],"random":[19,40,60,84,116],"according":[20],"some":[22],"probability":[23,53,78],"distribution.":[24],"The":[25],"optimal":[26,34,96],"objective":[27,55],"an":[29,95],"RCP,":[30],"and":[31,56,93,108],"its":[32],"associated":[33],"solution":[35,97],"(when":[36],"it":[37],"exists),":[38],"variables:":[41],"RCP":[42],"theory":[43],"is":[44],"mainly":[45],"concerned":[46],"with":[47],"providing":[48],"probabilistic":[49],"assessments":[50],"on":[51,74],"the":[52,67,75],"constraint":[57,76],"violation":[58,77],"in":[59,98],"programs.":[62,118],"In":[63],"recent":[65],"contribution,":[66],"authors":[68],"provide":[69,110],"tight":[71],"upper":[72],"bound":[73],"for":[79,114],"restricted":[81],"class":[82],"assumed":[89],"be":[91],"feasible":[92],"attain":[94],"every":[99],"possible":[100],"problem":[101],"realization.":[102],"Here,":[103],"we":[104,109],"remove":[105],"this":[106],"restriction":[107],"result":[112],"holding":[113],"general":[115]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}