{"id":"https://openalex.org/W2128244396","doi":"https://doi.org/10.1137/130925013","title":"A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization","display_name":"A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2128244396","doi":"https://doi.org/10.1137/130925013","mag":"2128244396"},"language":"en","primary_location":{"id":"doi:10.1137/130925013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130925013","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":true,"oa_status":"green","oa_url":"https://www.osti.gov/servlets/purl/1321089","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036216845","display_name":"Sanjay Mehrotra","orcid":"https://orcid.org/0000-0003-1106-1901"},"institutions":[{"id":"https://openalex.org/I4210155590","display_name":"Management Sciences (United States)","ror":"https://ror.org/05shz5j84","country_code":"US","type":"company","lineage":["https://openalex.org/I4210155590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjay Mehrotra","raw_affiliation_strings":["Industrial Engineering and Management Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Management Sciences","institution_ids":["https://openalex.org/I4210155590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058400272","display_name":"D\u00e1vid Papp","orcid":"https://orcid.org/0000-0003-4498-6417"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D\u00e1vid Papp","raw_affiliation_strings":["Northwestern University","North Carolina State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University","institution_ids":[]},{"raw_affiliation_string":"North Carolina State University","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.042,"has_fulltext":true,"cited_by_count":73,"citation_normalized_percentile":{"value":0.95195391,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"24","issue":"4","first_page":"1670","last_page":"1697"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10969","display_name":"Water resources management and optimization","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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.718481183052063},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.654985249042511},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.642549455165863},{"id":"https://openalex.org/keywords/moment","display_name":"Moment (physics)","score":0.548538863658905},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5365291833877563},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5222043395042419},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.520828127861023},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5056183338165283},{"id":"https://openalex.org/keywords/moment-problem","display_name":"Moment problem","score":0.5000770092010498},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.44748812913894653},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.426339328289032},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.4217197299003601},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40999823808670044},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3433443307876587},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.29438138008117676},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.11062014102935791}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.718481183052063},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.654985249042511},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.642549455165863},{"id":"https://openalex.org/C179254644","wikidata":"https://www.wikidata.org/wiki/Q13222844","display_name":"Moment (physics)","level":2,"score":0.548538863658905},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5365291833877563},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5222043395042419},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.520828127861023},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5056183338165283},{"id":"https://openalex.org/C4285052","wikidata":"https://www.wikidata.org/wiki/Q3406268","display_name":"Moment problem","level":3,"score":0.5000770092010498},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.44748812913894653},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.426339328289032},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.4217197299003601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40999823808670044},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3433443307876587},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.29438138008117676},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.11062014102935791},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"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/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/130925013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130925013","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:osti.gov:1321089","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1321089","pdf_url":"https://www.osti.gov/servlets/purl/1321089","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1321089","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1321089","pdf_url":"https://www.osti.gov/servlets/purl/1321089","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2372008586","display_name":null,"funder_award_id":"SP0011568","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G3824163495","display_name":"Distribution and Moment-Robust Optimization Models and Algorithms","funder_award_id":"1100868","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8490819204","display_name":null,"funder_award_id":"CMMI-1100868","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2128244396.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1493472025","https://openalex.org/W1553000336","https://openalex.org/W1809030594","https://openalex.org/W1967184028","https://openalex.org/W1968355947","https://openalex.org/W1983611387","https://openalex.org/W2001033871","https://openalex.org/W2006599749","https://openalex.org/W2011575035","https://openalex.org/W2012350862","https://openalex.org/W2014857980","https://openalex.org/W2016231645","https://openalex.org/W2075887074","https://openalex.org/W2101508998","https://openalex.org/W2114467398","https://openalex.org/W2114650657","https://openalex.org/W2119069542","https://openalex.org/W2123493177","https://openalex.org/W2146643528","https://openalex.org/W2156168813","https://openalex.org/W2166798101","https://openalex.org/W2558813012","https://openalex.org/W2914166403","https://openalex.org/W3023788998"],"related_works":["https://openalex.org/W2065369945","https://openalex.org/W4386382407","https://openalex.org/W2005678164","https://openalex.org/W1857841162","https://openalex.org/W3138725819","https://openalex.org/W4311064410","https://openalex.org/W4292572523","https://openalex.org/W3146909488","https://openalex.org/W2952007803","https://openalex.org/W3105644203"],"abstract_inverted_index":{"We":[0,58],"present":[1],"and":[2,15,85,151,173,223],"analyze":[3],"a":[4,20,65,204,230,233],"central":[5,145,225],"cutting":[6,106,140,146,191,226],"surface":[7,107,141,192,227],"algorithm":[8,22,142,148,158,202,206,228],"for":[9,23,109],"general":[10,110,244],"semi-infinite":[11,111,128,165],"convex":[12,112,166],"optimization":[13,26,68,78,100,221,238],"problems":[14,27,69,101,125,239],"use":[16],"it":[17],"to":[18,64,96,124,143,203,213,232,249],"develop":[19],"novel":[21],"distributionally":[24,98,236],"robust":[25,77,99,237],"in":[28,55,160],"which":[29],"the":[30,56,83,89,105,139,144,154,161,184,190,196,224,246],"uncertainty":[31],"set":[32,179],"consists":[33],"of":[34,44,67,73,82,116,149,156,163,180,186,189,218,235],"probability":[35,210],"distributions":[36,211],"with":[37,70,75,102,126],"given":[38],"bounds":[39],"on":[40],"their":[41],"moments.":[42],"Moments":[43],"arbitrary":[45],"order,":[46],"as":[47,49],"well":[48],"nonpolynomial":[50],"moments,":[51],"can":[52],"be":[53],"included":[54],"formulation.":[57],"show":[59],"that":[60,207,240],"this":[61,219],"gives":[62],"rise":[63],"hierarchy":[66],"decreasing":[71],"levels":[72],"risk-aversion,":[74],"classic":[76],"at":[79,88],"one":[80],"end":[81],"spectrum":[84],"stochastic":[86],"programming":[87,167],"other.":[90],"Although":[91],"our":[92,157],"primary":[93],"motivation":[94],"is":[95,114,122],"solve":[97],"moment":[103,198,214],"uncertainty,":[104],"method":[108,121,222],"programs":[113],"also":[115],"independent":[117],"interest.":[118],"The":[119,216],"proposed":[120,248],"applicable":[123],"nondifferentiable":[127],"constraints":[129,170],"indexed":[130,175],"by":[131,176],"an":[132,177],"infinite":[133],"dimensional":[134],"index":[135,178],"set.":[136],"Examples":[137],"comparing":[138],"plane":[147],"Kortanek":[150],"No":[152],"demonstrate":[153],"potential":[155],"even":[159],"solution":[162,231],"traditional":[164],"problems,":[168],"whose":[169],"are":[171,174,241],"differentiable,":[172],"low":[181],"dimension.":[182],"After":[183],"rate":[185],"convergence":[187],"analysis":[188],"algorithm,":[193],"we":[194],"extend":[195],"authors'":[197],"matching":[199],"scenario":[200],"generation":[201],"probabilistic":[205],"finds":[208],"optimal":[209],"subject":[212],"constraints.":[215],"combination":[217],"distribution":[220],"yields":[229],"family":[234],"considerably":[242],"more":[243],"than":[245],"ones":[247],"date.":[250]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}