{"id":"https://openalex.org/W2346898445","doi":"https://doi.org/10.1080/10556788.2016.1175002","title":"Incremental subgradient method for nonsmooth convex optimization with fixed point constraints","display_name":"Incremental subgradient method for nonsmooth convex optimization with fixed point constraints","publication_year":2016,"publication_date":"2016-05-02","ids":{"openalex":"https://openalex.org/W2346898445","doi":"https://doi.org/10.1080/10556788.2016.1175002","mag":"2346898445"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1175002","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1175002","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/A5016609320","display_name":"Hideaki Iiduka","orcid":"https://orcid.org/0000-0001-9173-6723"},"institutions":[{"id":"https://openalex.org/I16656306","display_name":"Meiji University","ror":"https://ror.org/02rqvrp93","country_code":"JP","type":"education","lineage":["https://openalex.org/I16656306"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"H. Iiduka","raw_affiliation_strings":["Department of Computer Science, Meiji University, 1-1-1 Higashimita, Tama-ku, Kawasaki-shi, Kanagawa 214-8571, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Meiji University, 1-1-1 Higashimita, Tama-ku, Kawasaki-shi, Kanagawa 214-8571, Japan","institution_ids":["https://openalex.org/I16656306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016609320"],"corresponding_institution_ids":["https://openalex.org/I16656306"],"apc_list":null,"apc_paid":null,"fwci":2.1071,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88030451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"5","first_page":"931","last_page":"951"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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/T11777","display_name":"Fixed Point Theorems Analysis","score":0.9534000158309937,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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.9414045810699463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.715688943862915},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6224238872528076},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5565236210823059},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5457730293273926},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.526680588722229},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.47963911294937134},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.45213761925697327},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44407549500465393},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4424901604652405},{"id":"https://openalex.org/keywords/hilbert-space","display_name":"Hilbert space","score":0.440314382314682},{"id":"https://openalex.org/keywords/projection-method","display_name":"Projection method","score":0.4356391429901123},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4206121563911438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.384404718875885},{"id":"https://openalex.org/keywords/dykstras-projection-algorithm","display_name":"Dykstra's projection algorithm","score":0.33707332611083984},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21227574348449707},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08025261759757996}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9414045810699463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.715688943862915},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6224238872528076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5565236210823059},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5457730293273926},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.526680588722229},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.47963911294937134},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.45213761925697327},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44407549500465393},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4424901604652405},{"id":"https://openalex.org/C62799726","wikidata":"https://www.wikidata.org/wiki/Q190056","display_name":"Hilbert space","level":2,"score":0.440314382314682},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.4356391429901123},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4206121563911438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.384404718875885},{"id":"https://openalex.org/C202426404","wikidata":"https://www.wikidata.org/wiki/Q5318686","display_name":"Dykstra's projection algorithm","level":2,"score":0.33707332611083984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21227574348449707},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08025261759757996},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2016.1175002","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1175002","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/G8791501049","display_name":"Distributed Fixed Point Subgradient Methods for Solving Large-scale, Complicated Network Resource Allocation Problems","funder_award_id":"15K04763","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W205960364","https://openalex.org/W1546168022","https://openalex.org/W1572996156","https://openalex.org/W1583497301","https://openalex.org/W1791808123","https://openalex.org/W1946620893","https://openalex.org/W1974228432","https://openalex.org/W1987497363","https://openalex.org/W1988795359","https://openalex.org/W1989626574","https://openalex.org/W1990645806","https://openalex.org/W2003718663","https://openalex.org/W2016362012","https://openalex.org/W2019569173","https://openalex.org/W2020532300","https://openalex.org/W2021902942","https://openalex.org/W2023610498","https://openalex.org/W2030618034","https://openalex.org/W2031658331","https://openalex.org/W2033511209","https://openalex.org/W2037124030","https://openalex.org/W2037710455","https://openalex.org/W2047873339","https://openalex.org/W2049659086","https://openalex.org/W2053487511","https://openalex.org/W2058532290","https://openalex.org/W2067313264","https://openalex.org/W2067881676","https://openalex.org/W2069435104","https://openalex.org/W2076428552","https://openalex.org/W2082473969","https://openalex.org/W2115321886","https://openalex.org/W2142280715","https://openalex.org/W2147524058","https://openalex.org/W2246091536","https://openalex.org/W2622705236","https://openalex.org/W3100489614","https://openalex.org/W4229650096","https://openalex.org/W4249667877","https://openalex.org/W4296180618"],"related_works":["https://openalex.org/W1991765628","https://openalex.org/W4362514784","https://openalex.org/W3164499765","https://openalex.org/W2015928709","https://openalex.org/W3005426141","https://openalex.org/W2026392561","https://openalex.org/W1561297735","https://openalex.org/W2078980565","https://openalex.org/W2392510576","https://openalex.org/W2910556747"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"incremental":[4,56],"subgradient":[5,57],"method":[6,58],"for":[7,86,119],"solving":[8],"the":[9,13,21,54,70,73,100,112,132,136,145,150,155,165,168,183,186,194],"problem":[10,169],"of":[11,15,23,27,131,177],"minimizing":[12],"sum":[14],"nondifferentiable,":[16],"convex":[17],"objective":[18],"functions":[19],"over":[20,43],"intersection":[22],"fixed":[24],"point":[25],"sets":[26,45],"nonexpansive":[28],"mappings":[29],"in":[30,40,69,185],"a":[31,64,87,97,103,109,120,129,142,158],"real":[32,178],"Hilbert":[33],"space.":[34],"The":[35,91],"proposed":[36],"algorithm":[37,101,137,156],"can":[38,59,77],"work":[39],"nonsmooth":[41],"optimization":[42],"constraint":[44,65],"onto":[46,75],"which":[47,138,181],"projections":[48],"cannot":[49],"be":[50,60,78],"always":[51],"implemented,":[52],"whereas":[53],"conventional":[55],"applied":[61,179],"only":[62],"when":[63],"set":[66],"is":[67,96],"simple":[68],"sense":[71],"that":[72,94,99,126],"projection":[74],"it":[76],"easily":[79],"implemented.":[80],"We":[81,173],"first":[82],"study":[83,116],"its":[84,117],"convergence":[85,118,187,195],"constant":[88,105],"step":[89,106,122,160],"size.":[90],"analysis":[92],"indicates":[93],"there":[95,127],"possibility":[98],"with":[102,157],"small":[104],"size":[107,123,161],"approximates":[108],"solution":[110,143,166],"to":[111,141,144,164,167,192],"problem.":[113,146],"Next,":[114],"we":[115,148],"diminishing":[121,159],"and":[124,189],"show":[125,149],"exists":[128],"subsequence":[130],"sequence":[133,152],"generated":[134,153],"by":[135,154],"weakly":[139],"converges":[140,163],"Moreover,":[147],"whole":[151],"strongly":[162],"under":[170],"certain":[171],"assumptions.":[172],"also":[174],"give":[175],"examples":[176,191],"problems":[180],"satisfy":[182],"assumptions":[184],"theorems":[188],"numerical":[190],"support":[193],"analyses.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}