{"id":"https://openalex.org/W2099506495","doi":"https://doi.org/10.1137/050622328","title":"Convex Approximations of Chance Constrained Programs","display_name":"Convex Approximations of Chance Constrained Programs","publication_year":2006,"publication_date":"2006-11-29","ids":{"openalex":"https://openalex.org/W2099506495","doi":"https://doi.org/10.1137/050622328","mag":"2099506495"},"language":"en","primary_location":{"id":"doi:10.1137/050622328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050622328","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-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/A5018700487","display_name":"Arkadi Nemirovski","orcid":"https://orcid.org/0000-0002-5001-7420"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arkadi Nemirovski","raw_affiliation_strings":["[Georgia Institute of Technology.]"],"affiliations":[{"raw_affiliation_string":"[Georgia Institute of Technology.]","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025917676","display_name":"Alexander Shapiro","orcid":"https://orcid.org/0000-0002-4776-0053"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Shapiro","raw_affiliation_strings":["[Georgia Institute of Technology.]"],"affiliations":[{"raw_affiliation_string":"[Georgia Institute of Technology.]","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018700487"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":26.6777,"has_fulltext":false,"cited_by_count":1148,"citation_normalized_percentile":{"value":0.9975804,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"17","issue":"4","first_page":"969","last_page":"996"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9993000030517578,"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.9993000030517578,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9977999925613403,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7690053582191467},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5862681865692139},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5423359274864197},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.506217896938324},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4568132162094116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16815131902694702}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7690053582191467},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5862681865692139},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5423359274864197},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.506217896938324},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4568132162094116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16815131902694702},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/050622328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050622328","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.4747","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.4747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isye.gatech.edu/people/faculty/Alex_Shapiro/SIAM-NS06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W66371144","https://openalex.org/W88909337","https://openalex.org/W103594849","https://openalex.org/W1490324987","https://openalex.org/W1503221585","https://openalex.org/W1531335330","https://openalex.org/W1546638125","https://openalex.org/W1594103238","https://openalex.org/W1647779468","https://openalex.org/W1983916623","https://openalex.org/W2003777645","https://openalex.org/W2006041100","https://openalex.org/W2006093909","https://openalex.org/W2007668370","https://openalex.org/W2014838276","https://openalex.org/W2019291268","https://openalex.org/W2059120410","https://openalex.org/W2060416080","https://openalex.org/W2083350518","https://openalex.org/W2092123844","https://openalex.org/W2102033867","https://openalex.org/W2113885151","https://openalex.org/W2116228093","https://openalex.org/W2117781171","https://openalex.org/W2118578357","https://openalex.org/W2127331687","https://openalex.org/W2132670515","https://openalex.org/W2150983233","https://openalex.org/W2158479468","https://openalex.org/W2167412190","https://openalex.org/W2798344481","https://openalex.org/W3038470872","https://openalex.org/W3048259557","https://openalex.org/W3106992008","https://openalex.org/W3122167364"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W3153752017"],"abstract_inverted_index":{"Abstract.":[0],"We":[1,66,129],"consider":[2],"a":[3,12,19,25,68,107,131,186],"chance":[4,63,79,119,141,168,199],"constrained":[5,64,80,120,142,169],"problem,":[6],"where":[7,171],"one":[8,23],"seeks":[9],"to":[10,22,36,43,112,163,183,185,193],"minimize":[11],"convex":[13,30,73,125,188],"objective":[14],"over":[15],"solutions":[16],"satisfying,":[17],"with":[18,56,177],"given":[20,187,207],"close":[21],"probability,":[24],"system":[26],"of":[27,71,76,117,166,180],"randomly":[28],"perturbed":[29],"constraints.":[31],"This":[32,122],"problem":[33,143],"may":[34],"happen":[35],"be":[37,194,202],"computationally":[38,46],"intractable;":[39],"our":[40,161],"goal":[41],"is":[42,124],"build":[44,106],"its":[45],"tractable":[47],"approximation,":[48,110,115],"i.e.,":[49],"an":[50],"efficiently":[51,127],"solvable":[52],"deterministic":[53],"optimization":[54],"program":[55],"the":[57,62,77,84,87,92,95,98,118,136,140,151,164,172,178,198],"feasible":[58],"set":[59,190],"contained":[60],"in":[61,91,97,139],"problem.":[65,81,121],"construct":[67],"general":[69],"class":[70],"such":[72],"conservative":[74],"approximations":[75],"corresponding":[78],"Moreover,":[82],"under":[83],"assumptions":[85],"that":[86],"constraints":[88],"are":[89,101,175],"affine":[90],"perturbations":[93,174],"and":[94,126,144,153],"entries":[96],"perturbation":[99],"vector":[100],"independent-of-each-other":[102],"random":[103,173],"variables,":[104],"we":[105,159],"large":[108],"deviation-type":[109],"referred":[111],"as":[113],"\u201cBernstein":[114],"\u201d":[116],"approximation":[123,156],"solvable.":[128],"propose":[130],"simulation-based":[132],"scheme":[133],"for":[134,204],"bounding":[135],"optimal":[137],"value":[138],"report":[145],"numerical":[146],"experiments":[147],"aimed":[148],"at":[149],"comparing":[150],"Bernstein":[152],"well-known":[154],"scenario":[155],"approaches.":[157],"Finally,":[158],"extend":[160],"construction":[162],"case":[165],"ambiguous":[167],"problems,":[170],"independent":[176],"collection":[179],"distributions":[181],"known":[182,195],"belong":[184],"compact":[189],"rather":[191],"than":[192],"exactly,":[196],"while":[197],"constraint":[200],"should":[201],"satisfied":[203],"every":[205],"distribution":[206],"by":[208],"this":[209],"set.":[210]},"counts_by_year":[{"year":2026,"cited_by_count":17},{"year":2025,"cited_by_count":68},{"year":2024,"cited_by_count":71},{"year":2023,"cited_by_count":75},{"year":2022,"cited_by_count":81},{"year":2021,"cited_by_count":95},{"year":2020,"cited_by_count":85},{"year":2019,"cited_by_count":90},{"year":2018,"cited_by_count":72},{"year":2017,"cited_by_count":78},{"year":2016,"cited_by_count":61},{"year":2015,"cited_by_count":71},{"year":2014,"cited_by_count":71},{"year":2013,"cited_by_count":47},{"year":2012,"cited_by_count":42}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}