{"id":"https://openalex.org/W7123350722","doi":"https://doi.org/10.1109/cdc57313.2025.11312534","title":"Privacy-Preserving Convex Optimization: When Differential Privacy Meets Stochastic Programming","display_name":"Privacy-Preserving Convex Optimization: When Differential Privacy Meets Stochastic Programming","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123350722","doi":"https://doi.org/10.1109/cdc57313.2025.11312534"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th 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/A5032659075","display_name":"Vladimir Dvorkin","orcid":"https://orcid.org/0000-0002-2023-5793"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vladimir Dvorkin","raw_affiliation_strings":["University of Michigan,Department of Electrical Engineering and Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan,Department of Electrical Engineering and Computer Science","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107099566","display_name":"Ferdinando Fioretto","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ferdinando Fioretto","raw_affiliation_strings":["University of Virginia,Department of Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Virginia,Department of Computer Science","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035808622","display_name":"Pascal Van Hentenryck","orcid":"https://orcid.org/0000-0001-7085-9994"},"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":"Pascal Van Hentenryck","raw_affiliation_strings":["Georgia Institute of Technology,H. Milton Stewart School of Industrial and Systems Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,H. Milton Stewart School of Industrial and Systems Engineering","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Pierre Pinson","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pierre Pinson","raw_affiliation_strings":["Imperial College London,Dyson School of Design Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College London,Dyson School of Design Engineering","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jalal Kazempour","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jalal Kazempour","raw_affiliation_strings":["Technical University of Denmark,Department of Wind and Energy Systems"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark,Department of Wind and Energy Systems","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5032659075"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":4.2754,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.95364539,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"8149","last_page":"8156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.36160001158714294,"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"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.36160001158714294,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.33719998598098755,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.1509000062942505,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.7788000106811523},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.7060999870300293},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6208999752998352},{"id":"https://openalex.org/keywords/perturbation","display_name":"Perturbation (astronomy)","score":0.6035000085830688},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5439000129699707},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5407999753952026},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5264999866485596},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4544999897480011},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4359000027179718}],"concepts":[{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.7788000106811523},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.7060999870300293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6358000040054321},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6208999752998352},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.6035000085830688},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5439000129699707},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5407999753952026},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5264999866485596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4781999886035919},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4544999897480011},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4359000027179718},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34549999237060547},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3361999988555908},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.33169999718666077},{"id":"https://openalex.org/C2986577269","wikidata":"https://www.wikidata.org/wiki/Q11306265","display_name":"Random noise","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C123201435","wikidata":"https://www.wikidata.org/wiki/Q456632","display_name":"Information privacy","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.27880001068115234},{"id":"https://openalex.org/C2779880469","wikidata":"https://www.wikidata.org/wiki/Q17084424","display_name":"Simultaneous perturbation stochastic approximation","level":3,"score":0.27320000529289246},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.2669999897480011},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2653000056743622},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C109578324","wikidata":"https://www.wikidata.org/wiki/Q3354463","display_name":"Random optimization","level":5,"score":0.25769999623298645},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2556999921798706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7509315013885498,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Convex":[0],"optimization":[1,6,21,33,50,56,102],"finds":[2],"many":[3],"applications":[4],"where":[5],"results":[7],"may":[8],"expose":[9],"private":[10],"data":[11,22,51],"(e.g.,":[12],"health":[13],"records,":[14],"commercial":[15],"information).":[16],"To":[17],"guarantee":[18],"privacy":[19,106],"to":[20,73],"owners,":[23],"we":[24,54,68],"develop":[25],"a":[26,61],"new":[27],"privacy-preserving":[28],"perturbation":[29,63,76,85],"strategy":[30],"for":[31],"convex":[32],"programs":[34],"by":[35],"combining":[36],"stochastic":[37],"(chance-constrained)":[38],"programming":[39],"and":[40,88],"differential":[41],"privacy.":[42],"Unlike":[43],"standard":[44],"noise-additive":[45],"strategies,":[46],"which":[47],"perturb":[48],"either":[49],"or":[52],"result,":[53],"formulate":[55],"variables":[57],"as":[58],"functions":[59],"of":[60,93],"random":[62],"using":[64,81],"linear":[65],"decision":[66],"rules;":[67],"then":[69],"optimize":[70],"these":[71],"rules":[72],"accommodate":[74],"the":[75,78,91],"within":[77],"feasible":[79,87],"region":[80],"chance":[82],"constraints.":[83],"The":[84],"becomes":[86],"makes":[89],"adjacent\u2014in":[90],"sense":[92],"some":[94],"distance":[95],"function\u2014optimization":[96],"datasets":[97],"statistically":[98],"similar":[99],"in":[100],"randomized":[101],"results,":[103],"thereby":[104],"enabling":[105],"guarantees.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-04-29T09:16:38.111599","created_date":"2026-01-14T00:00:00"}