{"id":"https://openalex.org/W3011851094","doi":"https://doi.org/10.1109/cdc40024.2019.9029233","title":"Random minibatch projection algorithms for convex feasibility problems","display_name":"Random minibatch projection algorithms for convex feasibility problems","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3011851094","doi":"https://doi.org/10.1109/cdc40024.2019.9029233","mag":"3011851094"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9029233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029233","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th 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/A5110629459","display_name":"Angelia Nedi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Angelia Nedic","raw_affiliation_strings":["Electrical, Computer and Energy Engineering Department, Arizona State University, Tempe, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Electrical, Computer and Energy Engineering Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110629459"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.23661473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"i and ii","issue":null,"first_page":"1507","last_page":"1512"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9983000159263611,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.8310905694961548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5992953181266785},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5910934209823608},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5354571342468262},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5250304341316223},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5242412686347961},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5043264627456665},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4919426143169403},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.48715874552726746},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4815831184387207},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.4569956660270691},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4507298171520233},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.43436288833618164},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4295789301395416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.369992196559906}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8310905694961548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5992953181266785},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5910934209823608},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5354571342468262},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5250304341316223},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5242412686347961},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5043264627456665},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4919426143169403},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.48715874552726746},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4815831184387207},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.4569956660270691},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4507298171520233},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.43436288833618164},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4295789301395416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.369992196559906},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc40024.2019.9029233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029233","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W92732855","https://openalex.org/W1543439990","https://openalex.org/W1575441071","https://openalex.org/W1577020372","https://openalex.org/W1964995199","https://openalex.org/W1976597683","https://openalex.org/W2012180727","https://openalex.org/W2033468335","https://openalex.org/W2054796771","https://openalex.org/W2064114733","https://openalex.org/W2085440994","https://openalex.org/W2100885264","https://openalex.org/W2130469840","https://openalex.org/W2131247345","https://openalex.org/W2144037063","https://openalex.org/W2145867192","https://openalex.org/W2156122508","https://openalex.org/W2162461247","https://openalex.org/W2321466613","https://openalex.org/W2695988161","https://openalex.org/W2972606536","https://openalex.org/W2985739199","https://openalex.org/W3214217583","https://openalex.org/W4205555171","https://openalex.org/W4249667877","https://openalex.org/W4288102462","https://openalex.org/W6634488418","https://openalex.org/W6739674677","https://openalex.org/W6768610491"],"related_works":["https://openalex.org/W2356261519","https://openalex.org/W2026600343","https://openalex.org/W4382519084","https://openalex.org/W2478309485","https://openalex.org/W3092518081","https://openalex.org/W2002037426","https://openalex.org/W3020982396","https://openalex.org/W2040676043","https://openalex.org/W2617507642","https://openalex.org/W165488893"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3],"the":[4,9,15,39,62,68,100,114,119,123,131],"convex":[5,24,36,41,63],"feasibility":[6,64],"problem":[7,65],"where":[8,38],"feasible":[10],"set":[11,30],"is":[12,31,130],"given":[13],"as":[14,34],"intersection":[16],"of":[17,22,80,125],"a":[18,35,51,142],"(possibly":[19],"infinite)":[20],"number":[21],"closed":[23],"sets.":[25],"We":[26,47,108],"assume":[27],"that":[28,134],"each":[29],"specified":[32],"algebraically":[33],"inequality,":[37],"associated":[40],"function":[42],"may":[43],"be":[44],"even":[45],"non-differentiable.":[46],"present":[48],"and":[49],"analyze":[50],"random":[52,78,135],"minibatch":[53,86,120,136],"projection":[54,139],"algorithm":[55],"using":[56],"special":[57],"subgradient":[58,137],"iterations":[59],"for":[60,99],"solving":[61],"described":[66],"by":[67],"functional":[69,101],"constraints.":[70],"The":[71],"updates":[72,140],"are":[73],"performed":[74],"based":[75,138],"on":[76,118],"parallel":[77],"observations":[79],"several":[81],"constraint":[82],"components.":[83],"For":[84],"this":[85,128],"method":[87],"we":[88,103],"derive":[89,110],"asymptotic":[90],"convergence":[91,106],"results":[92],"and,":[93],"under":[94,112],"some":[95],"linear":[96,105],"regularity":[97],"condition":[98],"constraints,":[102],"prove":[104],"rate.":[107],"also":[109],"conditions":[111],"which":[113],"rate":[115],"depends":[116],"explicitly":[117],"size.":[121],"To":[122],"best":[124],"our":[126],"knowledge,":[127],"work":[129],"first":[132],"proving":[133],"have":[141],"better":[143],"complexity":[144],"than":[145],"their":[146],"single-sample":[147],"variants.":[148]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2025-10-10T00:00:00"}