{"id":"https://openalex.org/W1531536935","doi":"https://doi.org/10.1109/cacsd.2010.5612794","title":"Sequential randomized algorithms: A probabilistic cutting plane technique based on maximum volume ellipsoid center","display_name":"Sequential randomized algorithms: A probabilistic cutting plane technique based on maximum volume ellipsoid center","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W1531536935","doi":"https://doi.org/10.1109/cacsd.2010.5612794","mag":"1531536935"},"language":"en","primary_location":{"id":"doi:10.1109/cacsd.2010.5612794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacsd.2010.5612794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Computer-Aided Control System Design","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/A5088148601","display_name":"Takayuki Wada","orcid":"https://orcid.org/0000-0002-7342-9057"},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takayuki Wada","raw_affiliation_strings":["Department of Systems Science, Graduate School of System Informatics, Kobe University, Kobe, Japan","Department of Systems Science, Graduate School of System Informatics, Kobe University, Nada, 657-8501, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems Science, Graduate School of System Informatics, Kobe University, Kobe, Japan","institution_ids":["https://openalex.org/I65837984"]},{"raw_affiliation_string":"Department of Systems Science, Graduate School of System Informatics, Kobe University, Nada, 657-8501, Japan","institution_ids":["https://openalex.org/I65837984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007759108","display_name":"Yasumasa Fujisaki","orcid":"https://orcid.org/0000-0003-1529-1093"},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasumasa Fujisaki","raw_affiliation_strings":["Department of Systems Science, Graduate School of System Informatics, Kobe University, Kobe, Japan","Department of Systems Science, Graduate School of System Informatics, Kobe University, Nada, 657-8501, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems Science, Graduate School of System Informatics, Kobe University, Kobe, Japan","institution_ids":["https://openalex.org/I65837984"]},{"raw_affiliation_string":"Department of Systems Science, Graduate School of System Informatics, Kobe University, Nada, 657-8501, Japan","institution_ids":["https://openalex.org/I65837984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I65837984"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.05964215,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"37","issue":null,"first_page":"1533","last_page":"1538"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9976000189781189,"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.7296816110610962},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.7018737196922302},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6641049385070801},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.6530625224113464},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6333057284355164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.59367436170578},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5568874478340149},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5073649287223816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5066693425178528},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4387015998363495},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43438467383384705},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.41927266120910645},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41563478112220764},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3973735272884369},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2922859191894531},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.1431102752685547},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.0834227204322815}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7296816110610962},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.7018737196922302},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6641049385070801},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.6530625224113464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6333057284355164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.59367436170578},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5568874478340149},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5073649287223816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5066693425178528},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4387015998363495},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43438467383384705},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.41927266120910645},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41563478112220764},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3973735272884369},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2922859191894531},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.1431102752685547},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.0834227204322815},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cacsd.2010.5612794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cacsd.2010.5612794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Computer-Aided Control System Design","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":19,"referenced_works":["https://openalex.org/W1568307856","https://openalex.org/W1582865675","https://openalex.org/W1976466849","https://openalex.org/W2003234103","https://openalex.org/W2014211039","https://openalex.org/W2055356142","https://openalex.org/W2066459185","https://openalex.org/W2125107769","https://openalex.org/W2128509816","https://openalex.org/W2134815022","https://openalex.org/W2167193135","https://openalex.org/W2167412190","https://openalex.org/W2167514836","https://openalex.org/W2179840881","https://openalex.org/W2803636622","https://openalex.org/W4251616545","https://openalex.org/W4294968333","https://openalex.org/W6651132938","https://openalex.org/W6684331890"],"related_works":["https://openalex.org/W2031732959","https://openalex.org/W2235431948","https://openalex.org/W7739709","https://openalex.org/W2016090484","https://openalex.org/W2562629174","https://openalex.org/W1500330311","https://openalex.org/W2061711344","https://openalex.org/W2167193135","https://openalex.org/W1531536935","https://openalex.org/W2510642498"],"abstract_inverted_index":{"A":[0],"sequential":[1],"randomized":[2],"algorithm":[3,30,74,121],"is":[4,10,31,83,117,130,147],"developed":[5],"for":[6,24],"robust":[7,109,155],"optimization":[8,100,110,138],"which":[9,82,101],"to":[11,18,103],"minimize":[12],"a":[13,19,34,60,77,93,97,104,112,124],"linear":[14],"objective":[15],"function":[16],"subject":[17],"parameter":[20,27],"dependent":[21],"convex":[22],"constraint":[23,99],"all":[25],"uncertain":[26,71],"values.":[28],"The":[29],"realized":[32],"as":[33],"probabilistic":[35,105],"cutting":[36,63],"plane":[37],"technique":[38],"based":[39],"on":[40],"maximum":[41],"volume":[42],"ellipsoid":[43],"center,":[44],"where":[45],"candidates":[46],"of":[47,52,62,69,80,84,87,96,107,134,153],"the":[48,53,70,88,108,120,131,135,140,150,154],"optimal":[49,54,132,151],"value":[50,126,133,152],"and":[51,91,143],"solution":[55,95],"are":[56],"sequentially":[57],"updated":[58],"by":[59,66,149],"series":[61],"planes":[64],"generated":[65],"random":[67],"samples":[68],"parameters.":[72],"This":[73],"stops":[75],"in":[76],"finite":[78],"number":[79],"iterations":[81],"polynomial":[85],"order":[86],"problem":[89],"size,":[90],"provides":[92],"feasible":[94],"chance":[98,136],"corresponds":[102],"relaxation":[106],"with":[111,139],"prescribed":[113,141],"probability.":[114],"Then,":[115],"it":[116],"shown":[118],"that":[119],"can":[122],"find":[123],"suboptimal":[125],"whose":[127,144],"lower":[128],"bound":[129,146],"constrained":[137],"probability":[142],"upper":[145],"determined":[148],"optimization.":[156]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}