{"id":"https://openalex.org/W2153927874","doi":"https://doi.org/10.1109/cdc.2008.4739188","title":"A randomized cutting plane scheme with geometric convergence: Probabilistic analysis and SDP applications","display_name":"A randomized cutting plane scheme with geometric convergence: Probabilistic analysis and SDP applications","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2153927874","doi":"https://doi.org/10.1109/cdc.2008.4739188","mag":"2153927874"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2008.4739188","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4739188","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","raw_type":"proceedings-article"},"type":"conference-paper","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":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]},{"id":"https://openalex.org/I4210100607","display_name":"Institute of Electronics, Computer and Telecommunication Engineering","ror":"https://ror.org/00n4jbh84","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210100607","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Dabbene","raw_affiliation_strings":["Politecnico di Torino, IEIIT CNR, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Torino, IEIIT CNR, Italy","institution_ids":["https://openalex.org/I177477856","https://openalex.org/I4210100607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030456599","display_name":"Pavel Shcherbakov","orcid":"https://orcid.org/0000-0002-4033-2507"},"institutions":[{"id":"https://openalex.org/I4210141449","display_name":"Institute of Professional Innovations","ror":"https://ror.org/034f9gk34","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210141449"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"P. Shcherbakov","raw_affiliation_strings":["IPU, Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IPU, Moscow, Russia","institution_ids":["https://openalex.org/I4210141449"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032697658","display_name":"B. T. Polyak","orcid":"https://orcid.org/0000-0002-1898-2984"},"institutions":[{"id":"https://openalex.org/I4210141449","display_name":"Institute of Professional Innovations","ror":"https://ror.org/034f9gk34","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210141449"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"B.T. Polyak","raw_affiliation_strings":["IPU, Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IPU, Moscow, Russia","institution_ids":["https://openalex.org/I4210141449"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"125","issue":null,"first_page":"3044","last_page":"3049"},"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.9980000257492065,"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.9980000257492065,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6220412254333496},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5671142935752869},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5522793531417847},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5014195442199707},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.47720059752464294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4735915958881378},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.47306740283966064},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.4656912088394165},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.45979711413383484},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4563702642917633},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.45042526721954346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4491715431213379},{"id":"https://openalex.org/keywords/convex-body","display_name":"Convex body","score":0.448075532913208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4398490786552429},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.36935484409332275},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.3527681827545166},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.32837629318237305}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6220412254333496},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5671142935752869},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5522793531417847},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5014195442199707},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.47720059752464294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4735915958881378},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.47306740283966064},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.4656912088394165},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.45979711413383484},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4563702642917633},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.45042526721954346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4491715431213379},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.448075532913208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4398490786552429},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.36935484409332275},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3527681827545166},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.32837629318237305},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2008.4739188","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4739188","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1509650865","https://openalex.org/W1632601927","https://openalex.org/W1809030594","https://openalex.org/W1966454199","https://openalex.org/W1967134148","https://openalex.org/W2005900349","https://openalex.org/W2006162240","https://openalex.org/W2055582487","https://openalex.org/W2063986634","https://openalex.org/W2076304889","https://openalex.org/W2091561873","https://openalex.org/W2106318612","https://openalex.org/W2125299871","https://openalex.org/W2132345981","https://openalex.org/W2134815022","https://openalex.org/W3023788998","https://openalex.org/W3210839039","https://openalex.org/W3212877690","https://openalex.org/W4294968333","https://openalex.org/W6630343154","https://openalex.org/W6638222465","https://openalex.org/W6804506699"],"related_works":["https://openalex.org/W2151689585","https://openalex.org/W2380816257","https://openalex.org/W2073713056","https://openalex.org/W3110702597","https://openalex.org/W3087071515","https://openalex.org/W2078761926","https://openalex.org/W2110441383","https://openalex.org/W2125620709","https://openalex.org/W2510642498","https://openalex.org/W1531536935"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,14,18,56,113,137,170],"randomized":[3,166],"method":[4,49,82,98,118],"for":[5,65,80,133,143,157],"general":[6],"convex":[7,19,73],"optimization":[8,145],"problems;":[9],"namely,":[10],"the":[11,30,33,38,41,45,53,72,94,97,102,117,165],"minimization":[12],"of":[13,40,68,78,87,116,125,153],"linear":[15,46],"function":[16],"over":[17],"body.":[20,74],"The":[21,48,75,130],"idea":[22],"is":[23,50,60,83,108,119,136,141],"to":[24,172],"generate":[25],"N":[26],"random":[27,69],"points":[28,70],"inside":[29],"body,":[31],"choose":[32],"best":[34],"one":[35],"and":[36,149],"cut":[37],"part":[39],"body":[42],"defined":[43],"by":[44],"constraint.":[47],"analyzed":[51],"under":[52],"assumption":[54],"that":[55,96,164],"Uniform":[57],"Generating-Oracle":[58],"(UGO)":[59],"available":[61,142],"-":[62],"an":[63],"algorithm":[64,135],"uniform":[66],"generation":[67],"in":[71,110],"expected":[76],"rate":[77],"convergence":[79,88],"such":[81],"geometric.":[84],"Probabilistic":[85],"estimates":[86],"are":[89,160],"explicitly":[90],"derived:":[91],"we":[92],"estimate":[93],"probability":[95],"converges":[99],"slower":[100],"than":[101],"deterministic":[103,174],"center-of-gravity":[104],"algorithm.":[105],"Since":[106],"UGO":[107],"unavailable":[109],"most":[111,144],"applications,":[112],"practical":[114],"implementation":[115],"discussed,":[120],"based":[121],"on":[122],"Hit-and-Run":[123],"versions":[124],"Markov-chain":[126],"Monte":[127],"Carlo":[128],"algorithms.":[129,176],"crucial":[131],"notion":[132],"this":[134],"Boundary":[138],"Oracle,":[139],"which":[140,162],"problems,":[146],"including":[147],"LMIs":[148],"many":[150],"other":[151],"types":[152],"constraints.":[154],"Numerical":[155],"results":[156],"SDP":[158],"problems":[159],"presented,":[161],"confirm":[163],"approach":[167],"can":[168],"be":[169],"competitor":[171],"modern":[173],"interior-point":[175]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}