{"id":"https://openalex.org/W4213323278","doi":"https://doi.org/10.1080/10556788.2021.1998492","title":"Stochastic block projection algorithms with extrapolation for convex feasibility problems","display_name":"Stochastic block projection algorithms with extrapolation for convex feasibility problems","publication_year":2022,"publication_date":"2022-02-13","ids":{"openalex":"https://openalex.org/W4213323278","doi":"https://doi.org/10.1080/10556788.2021.1998492"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2021.1998492","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2021.1998492","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/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"]},{"id":"https://openalex.org/I58077936","display_name":"Romanian Academy","ror":"https://ror.org/0561n6946","country_code":"RO","type":"archive","lineage":["https://openalex.org/I58077936"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"I. Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania","Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, Bucharest, Romania","institution_ids":["https://openalex.org/I58077936"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":["https://openalex.org/I58077936","https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.8304,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.64305012,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"37","issue":"5","first_page":"1845","last_page":"1875"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991000294685364,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9988999962806702,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9973999857902527,"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/extrapolation","display_name":"Extrapolation","score":0.706285834312439},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6501133441925049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6334700584411621},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6089059114456177},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5832594633102417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.578549325466156},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5710582137107849},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5515350699424744},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4742545187473297},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.466826856136322},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.4583212435245514},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.41346976161003113},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3740551173686981},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.09850573539733887},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08675315976142883}],"concepts":[{"id":"https://openalex.org/C132459708","wikidata":"https://www.wikidata.org/wiki/Q744069","display_name":"Extrapolation","level":2,"score":0.706285834312439},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6501133441925049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6334700584411621},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6089059114456177},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5832594633102417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.578549325466156},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5710582137107849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5515350699424744},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4742545187473297},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.466826856136322},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.4583212435245514},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.41346976161003113},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3740551173686981},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.09850573539733887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08675315976142883},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2021.1998492","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2021.1998492","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2634698809","display_name":null,"funder_award_id":"2014-2021","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W292990780","https://openalex.org/W1520261777","https://openalex.org/W1591066233","https://openalex.org/W1964744380","https://openalex.org/W1965073581","https://openalex.org/W1975552883","https://openalex.org/W1976597683","https://openalex.org/W1977769089","https://openalex.org/W2033511209","https://openalex.org/W2054796771","https://openalex.org/W2066333552","https://openalex.org/W2067877923","https://openalex.org/W2073749939","https://openalex.org/W2075706482","https://openalex.org/W2081633016","https://openalex.org/W2085440994","https://openalex.org/W2094508696","https://openalex.org/W2113503719","https://openalex.org/W2131247345","https://openalex.org/W2153374208","https://openalex.org/W2162461247","https://openalex.org/W2167820643","https://openalex.org/W2288174618","https://openalex.org/W2321466613","https://openalex.org/W2334285086","https://openalex.org/W2963455674","https://openalex.org/W2963830980","https://openalex.org/W2980398138","https://openalex.org/W2985739199","https://openalex.org/W2991396480"],"related_works":["https://openalex.org/W1968270095","https://openalex.org/W2220129715","https://openalex.org/W4296478327","https://openalex.org/W2042397106","https://openalex.org/W4292651679","https://openalex.org/W2400034325","https://openalex.org/W2499557797","https://openalex.org/W2985014567","https://openalex.org/W4299515259","https://openalex.org/W2032676126"],"abstract_inverted_index":{"The":[0,181],"stochastic":[1,94,100,123],"alternating":[2],"projection":[3,125],"(SP)":[4],"algorithm":[5],"is":[6,85,179],"a":[7,27,132,170],"simple":[8,37],"but":[9],"powerful":[10],"approach":[11,84],"for":[12,97,108],"solving":[13],"convex":[14,75],"feasibility":[15,103,142],"problems.":[16],"At":[17],"each":[18],"step,":[19],"the":[20,23,32,98,120,136,140,146,149,174],"method":[21],"projects":[22],"current":[24],"iterate":[25],"onto":[26,79],"random":[28],"individual":[29],"set":[30],"from":[31],"intersection.":[33],"Hence,":[34],"it":[35],"has":[36],"iteration,":[38],"but,":[39],"usually,":[40],"convergences":[41],"slowly.":[42],"In":[43],"this":[44],"paper,":[45],"we":[46,152],"develop":[47],"accelerated":[48],"variants":[49],"of":[50,61,74,77,81,102,119,139,148,173],"basic":[51],"SP":[52],"method.":[53],"We":[54,66,113],"achieve":[55],"acceleration":[56],"using":[57],"two":[58],"ingredients:":[59],"blocks":[60,178],"sets":[62,175],"and":[63,91,105,144],"adaptive":[64,110,192],"extrapolation.":[65],"propose":[67],"SP-based":[68],"algorithms":[69,126,165,187],"based":[70,86],"on":[71,87,135,145],"extrapolated":[72,111],"iterations":[73],"combinations":[76],"projections":[78,190],"block":[80,124,189],"sets.":[82],"Our":[83,159],"several":[88],"new":[89],"ideas":[90],"tools,":[92],"including":[93],"selection":[95],"rules":[96],"blocks,":[99],"conditioning":[101],"problem,":[104],"novel":[106],"strategies":[107],"designing":[109],"stepsizes.":[112],"prove":[114,153],"that,":[115],"under":[116],"linear":[117],"regularity":[118],"sets,":[121],"our":[122,155],"converge":[127,157],"linearly":[128],"in":[129],"expectation,":[130],"with":[131,191],"rate":[133],"depending":[134],"condition":[137],"number":[138],"(block)":[141],"problem":[143],"size":[147],"blocks.":[150],"Otherwise,":[151],"that":[154,163],"methods":[156],"sublinearly.":[158],"convergence":[160,182],"analysis":[161],"reveals":[162],"such":[164],"are":[166],"most":[167],"effective":[168],"when":[169,186],"good":[171],"sampling":[172],"into":[176],"well-conditioned":[177],"given.":[180],"rates":[183],"also":[184],"explain":[185],"combining":[188],"extrapolation":[193],"work":[194],"better":[195],"than":[196],"their":[197],"nonextrapolated":[198],"variants.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2025-10-10T00:00:00"}