{"id":"https://openalex.org/W4416068581","doi":"https://doi.org/10.1080/10556788.2025.2576225","title":"An accelerated version of block cyclic subgradient projection method for solving convex feasibility problems","display_name":"An accelerated version of block cyclic subgradient projection method for solving convex feasibility problems","publication_year":2025,"publication_date":"2025-11-02","ids":{"openalex":"https://openalex.org/W4416068581","doi":"https://doi.org/10.1080/10556788.2025.2576225"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2025.2576225","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2025.2576225","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/A5020415571","display_name":"M. Abbasi","orcid":"https://orcid.org/0000-0001-8768-2021"},"institutions":[{"id":"https://openalex.org/I184468904","display_name":"University of Qom","ror":"https://ror.org/03ddeer04","country_code":"IR","type":"education","lineage":["https://openalex.org/I184468904"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mokhtar Abbasi","raw_affiliation_strings":["University of Qom","Department of Mathematics, University of Qom, Qom, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Qom","institution_ids":["https://openalex.org/I184468904"]},{"raw_affiliation_string":"Department of Mathematics, University of Qom, Qom, Iran","institution_ids":["https://openalex.org/I184468904"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087883807","display_name":"Touraj Nikazad","orcid":"https://orcid.org/0000-0002-9704-2893"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]},{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB","IR"],"is_corresponding":false,"raw_author_name":"Touraj Nikazad","raw_affiliation_strings":["Iran University of Science and Technology","Newcastle University","Department of Mathematics, Iran University of Science and Technology, Tehran, Iran","School of Engineering, Newcastle University, Newcastle Upon Tyne, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iran University of Science and Technology","institution_ids":["https://openalex.org/I67009956"]},{"raw_affiliation_string":"Newcastle University","institution_ids":["https://openalex.org/I84884186"]},{"raw_affiliation_string":"Department of Mathematics, Iran University of Science and Technology, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]},{"raw_affiliation_string":"School of Engineering, Newcastle University, Newcastle Upon Tyne, UK","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020415571"],"corresponding_institution_ids":["https://openalex.org/I184468904"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28521695,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"6","first_page":"1602","last_page":"1622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.7703999876976013,"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.7703999876976013,"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.20720000565052032,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.010099999606609344,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/subgradient-method","display_name":"Subgradient method","score":0.8199999928474426},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5709999799728394},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5687000155448914},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5685999989509583},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.521399974822998},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.38190001249313354},{"id":"https://openalex.org/keywords/projection-method","display_name":"Projection method","score":0.3763999938964844}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8199999928474426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6812999844551086},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5709999799728394},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5687000155448914},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5685999989509583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5422000288963318},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.521399974822998},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40059998631477356},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.38190001249313354},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.3763999938964844},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.3379000127315521},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.3059999942779541},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.2897999882698059},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C2983050975","wikidata":"https://www.wikidata.org/wiki/Q88287214","display_name":"Block structure","level":3,"score":0.2712000012397766},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2709999978542328},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.25119999051094055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2025.2576225","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2025.2576225","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1520261777","https://openalex.org/W1585386565","https://openalex.org/W1989820267","https://openalex.org/W2018657675","https://openalex.org/W2022330448","https://openalex.org/W2033511209","https://openalex.org/W2056603712","https://openalex.org/W2067877923","https://openalex.org/W2085440994","https://openalex.org/W2092527476","https://openalex.org/W2095255495","https://openalex.org/W2109982246","https://openalex.org/W2126290425","https://openalex.org/W2144037063","https://openalex.org/W2507011108","https://openalex.org/W2594107622","https://openalex.org/W2767053458","https://openalex.org/W2810169226","https://openalex.org/W2963814579","https://openalex.org/W3110018324","https://openalex.org/W4247591450","https://openalex.org/W4387497345"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,46,75],"modified":[4],"version":[5],"of":[6,55,83],"the":[7,18,28,32,53,56,60,81],"cyclic":[8],"subgradient":[9],"projection":[10],"(CSP)":[11],"method":[12,20],"using":[13],"blocks.":[14],"Within":[15],"each":[16,64],"block,":[17],"CSP":[19,33],"is":[21,35],"applied.":[22],"Subsequently,":[23],"an":[24],"operator":[25,41],"based":[26],"on":[27],"subgradients":[29],"derived":[30],"from":[31,89],"step":[34],"introduced.":[36],"Optimal":[37],"weights":[38,51],"for":[39,63],"this":[40],"are":[42,66],"determined":[43],"by":[44],"solving":[45],"small":[47],"quadratic":[48],"equation.":[49],"These":[50],"facilitate":[52],"acceleration":[54],"process.":[57],"Following":[58],"this,":[59],"introduced":[61],"operators":[62],"block":[65],"utilized":[67],"to":[68],"address":[69],"convex":[70],"feasibility":[71],"problems.":[72],"We":[73,79],"provide":[74],"comprehensive":[76],"convergence":[77],"analysis.":[78],"showcase":[80],"effectiveness":[82],"our":[84],"approach":[85],"through":[86],"examples":[87],"drawn":[88],"classical":[90],"scenarios":[91],"and":[92,96],"tomographic":[93],"imaging":[94],"applications":[95],"conduct":[97],"comparative":[98],"evaluations":[99],"with":[100],"other":[101],"pertinent":[102],"methods.":[103]},"counts_by_year":[],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2025-11-10T00:00:00"}