{"id":"https://openalex.org/W2083543317","doi":"https://doi.org/10.1137/080742506","title":"A Randomized Cutting Plane Method with Probabilistic Geometric Convergence","display_name":"A Randomized Cutting Plane Method with Probabilistic Geometric Convergence","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2083543317","doi":"https://doi.org/10.1137/080742506","mag":"2083543317"},"language":"en","primary_location":{"id":"doi:10.1137/080742506","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080742506","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/A5078379817","display_name":"Fabrizio Dabbene","orcid":"https://orcid.org/0000-0002-2258-8971"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Dabbene","raw_affiliation_strings":["fabrizio.dabbene@polito.it#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"fabrizio.dabbene@polito.it#TAB#","institution_ids":[]}]},{"author_position":"middle","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":"P. S. Shcherbakov","raw_affiliation_strings":["[email\u00a0protected] and [email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected] and [email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108653238","display_name":"B.T. Polyak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B. T. Polyak","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.306,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.96085141,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"6","first_page":"3185","last_page":"3207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9954000115394592,"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/mathematics","display_name":"Mathematics","score":0.6670947074890137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6176400780677795},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5023365020751953},{"id":"https://openalex.org/keywords/convex-body","display_name":"Convex body","score":0.499619722366333},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4900296926498413},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.46090424060821533},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.46021854877471924},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.44948914647102356},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.42343777418136597},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.40396174788475037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37087270617485046},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.344188928604126},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2884538173675537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2666160464286804}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6670947074890137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6176400780677795},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5023365020751953},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.499619722366333},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4900296926498413},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.46090424060821533},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.46021854877471924},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.44948914647102356},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.42343777418136597},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.40396174788475037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37087270617485046},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.344188928604126},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2884538173675537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2666160464286804},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/080742506","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080742506","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.434.7681","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.434.7681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2008/12/2161.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":36,"referenced_works":["https://openalex.org/W1513408185","https://openalex.org/W1514107797","https://openalex.org/W1539402525","https://openalex.org/W1568288633","https://openalex.org/W1632601927","https://openalex.org/W1809030594","https://openalex.org/W1931025732","https://openalex.org/W1966454199","https://openalex.org/W1967073510","https://openalex.org/W1967134148","https://openalex.org/W1972309199","https://openalex.org/W2005900349","https://openalex.org/W2006162240","https://openalex.org/W2015681706","https://openalex.org/W2028712970","https://openalex.org/W2041990574","https://openalex.org/W2055582487","https://openalex.org/W2063342497","https://openalex.org/W2063986634","https://openalex.org/W2069808690","https://openalex.org/W2076304889","https://openalex.org/W2091561873","https://openalex.org/W2106318612","https://openalex.org/W2118174564","https://openalex.org/W2125299871","https://openalex.org/W2132345981","https://openalex.org/W2134815022","https://openalex.org/W2153927874","https://openalex.org/W2159000620","https://openalex.org/W2295428206","https://openalex.org/W2536620281","https://openalex.org/W2611147814","https://openalex.org/W3162505434","https://openalex.org/W3210839039","https://openalex.org/W3212877690","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2362705850","https://openalex.org/W2379672298","https://openalex.org/W3169499720","https://openalex.org/W2029403470","https://openalex.org/W2352620736","https://openalex.org/W2048233275","https://openalex.org/W1535144845","https://openalex.org/W2065421600","https://openalex.org/W2510642498","https://openalex.org/W1531536935"],"abstract_inverted_index":{"We":[0,48],"propose":[1],"a":[2,14,18,57,113,154,167,195],"randomized":[3,240],"method":[4,91,158,174],"for":[5,69,89,203,215,232],"general":[6],"convex":[7,19,77,114,248],"optimization":[8,217,249],"problems;":[9],"namely,":[10],"the":[11,30,33,38,41,45,50,54,62,76,84,105,109,135,157,162,173,188,204,239],"minimization":[12],"of":[13,40,53,72,87,108,138,181,190,197,209,227],"linear":[15,46,220],"function":[16],"over":[17,112],"body.":[20],"The":[21],"idea":[22],"is":[23,79,92,99,207,213],"to":[24,94,150,245],"generate":[25],"N":[26],"random":[27,73,139],"points":[28,74,140],"inside":[29],"body,":[31],"choose":[32],"best":[34],"one,":[35],"and":[36,186,223],"cut":[37],"part":[39],"body":[42,78,115],"defined":[43],"by":[44],"constraint.":[47],"analyze":[49],"convergence":[51,88,128],"properties":[52,107],"algorithm":[55,68],"from":[56],"theoretical":[58],"viewpoint,":[59,169],"i.e.,":[60],"under":[61],"rather":[63],"standard":[64],"assumption":[65],"that":[66,116,141,208,238],"an":[67],"uniform":[70],"generation":[71],"in":[75,119,148,153],"available.":[80],"Under":[81],"this":[82,120,191],"assumption,":[83],"expected":[85],"rate":[86],"such":[90],"proved":[93],"be":[95,143,176,243],"geometric.":[96],"This":[97],"analysis":[98],"based":[100],"on":[101,104,127],"new":[102],"results":[103,126,231],"statistical":[106],"empirical":[110],"minimum":[111,136],"we":[117,133,170],"obtained":[118],"paper.":[121],"Moreover,":[122],"explicit":[123],"sample":[124],"size":[125],"are":[129,235],"derived.":[130],"In":[131],"particular,":[132],"compute":[134],"number":[137,196],"should":[142],"generated":[144],"at":[145],"each":[146],"step":[147],"order":[149],"guarantee":[151],"that,":[152],"probabilistic":[155],"sense,":[156],"performs":[159],"better":[160],"than":[161],"deterministic":[163,247],"center-of-gravity":[164],"algorithm.":[165],"From":[166],"practical":[168],"show":[171],"how":[172],"can":[175],"implemented":[177],"using":[178],"hit-and-run":[179,205],"versions":[180],"Markov-chain":[182],"Monte":[183],"Carlo":[184],"algorithms":[185],"exemplify":[187],"performance":[189],"implementable":[192],"modification":[193],"via":[194],"illustrative":[198],"problems.":[199],"A":[200],"crucial":[201],"notion":[202],"implementation":[206],"boundary":[210],"oracle,":[211],"which":[212],"available":[214],"most":[216],"problems":[218],"including":[219],"matrix":[221],"inequalities":[222],"many":[224],"other":[225],"kinds":[226],"constraints.":[228],"Preliminary":[229],"numerical":[230],"semidefinite":[233],"programs":[234],"presented":[236],"confirming":[237],"approach":[241],"might":[242],"competitive":[244],"modern":[246],"methods.":[250]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}