{"id":"https://openalex.org/W2047873339","doi":"https://doi.org/10.1137/110849456","title":"Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation","display_name":"Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2047873339","doi":"https://doi.org/10.1137/110849456","mag":"2047873339"},"language":"en","primary_location":{"id":"doi:10.1137/110849456","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110849456","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hideaki Iiduka","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5016609320"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4198,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.94713672,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"3","first_page":"862","last_page":"878"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9987000226974487,"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.9987000226974487,"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.9976999759674072,"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.9934999942779541,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7386786341667175},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.6034837365150452},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.6034102439880371},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5295613408088684},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5161436796188354},{"id":"https://openalex.org/keywords/dynamic-bandwidth-allocation","display_name":"Dynamic bandwidth allocation","score":0.5031408667564392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48758047819137573},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.45448753237724304},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.43387138843536377},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.42531126737594604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4201943278312683},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4143528342247009},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.41263625025749207}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7386786341667175},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.6034837365150452},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.6034102439880371},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5295613408088684},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5161436796188354},{"id":"https://openalex.org/C145062175","wikidata":"https://www.wikidata.org/wiki/Q5318947","display_name":"Dynamic bandwidth allocation","level":3,"score":0.5031408667564392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48758047819137573},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.45448753237724304},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.43387138843536377},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.42531126737594604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4201943278312683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4143528342247009},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.41263625025749207},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110849456","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110849456","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G6377014370","display_name":"Optimization of supply and demand coordination based on incomplete and asymmetric information in resource sharing on the network","funder_award_id":"23500090","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":10,"referenced_works":["https://openalex.org/W1987497363","https://openalex.org/W2021902942","https://openalex.org/W2033511209","https://openalex.org/W2053487511","https://openalex.org/W2067313264","https://openalex.org/W2115158696","https://openalex.org/W2115321886","https://openalex.org/W2147524058","https://openalex.org/W2153553458","https://openalex.org/W2254398807"],"related_works":["https://openalex.org/W2057490875","https://openalex.org/W4251345889","https://openalex.org/W4233765508","https://openalex.org/W2144194959","https://openalex.org/W1997315818","https://openalex.org/W2148705057","https://openalex.org/W2122266837","https://openalex.org/W1990230466","https://openalex.org/W2903957039","https://openalex.org/W2107680962"],"abstract_inverted_index":{"In":[0],"this":[1,76],"paper,":[2],"we":[3,164],"discuss":[4,83],"a":[5,13,36,44,47,54,84,90,111],"variational":[6,48],"inequality":[7,49],"problem":[8,41,88],"with":[9,60,89],"the":[10,19,24,28,40,51,57,61,65,71,96,100,106,114,128,138,150,180,187,191,196],"gradient":[11,52],"of":[12,23,39,56,70,75,195],"nonconvex":[14,176],"objective":[15,74],"function":[16,93],"in":[17,68,94,105],"which":[18,95],"constraint":[20],"set":[21,26,59],"composed":[22],"absolute":[25,58],"and":[27,133,193],"subsidiary":[29,66],"sets":[30,67],"is":[31,78],"not":[32,155],"feasible.":[33],"We":[34],"formulate":[35],"compromise":[37],"solution":[38,45],"by":[42],"using":[43],"to":[46,64,79,82,126,178],"for":[50,149,173,186],"over":[53],"subset":[55],"elements":[62],"closest":[63],"terms":[69],"norm.":[72],"The":[73],"paper":[77],"enable":[80],"us":[81],"network":[85],"bandwidth":[86,112,116,151,182,188],"allocation":[87,152,189],"nonconcave":[91],"utility":[92],"compoundable":[97],"constraints":[98,130],"about":[99],"preferable":[101],"transmission":[102,139],"rate":[103,140],"fall":[104],"infeasible":[107],"region.":[108],"For":[109],"such":[110],"allocation,":[113],"ideal":[115],"must":[117],"be":[118],"quickly":[119],"shared":[120],"among":[121],"traffic":[122],"sources":[123],"so":[124],"as":[125,143,145],"satisfy":[127],"capacity":[129],"(absolute":[131],"constraints)":[132,142],"all":[134],"sources'":[135],"demands":[136],"regarding":[137],"(subsidiary":[141],"much":[144],"possible.":[146],"Iterative":[147],"algorithms":[148],"should":[153],"thus":[154],"involve":[156],"auxiliary":[157],"optimization":[158,177],"problems":[159],"or":[160],"complicated":[161],"computations.":[162],"Here,":[163],"devise":[165],"an":[166,170],"algorithm":[167],"based":[168],"on":[169],"iterative":[171],"technique":[172],"triple-hierarchical":[174],"constrained":[175],"achieve":[179],"optimal":[181],"allocation.":[183],"Numerical":[184],"examples":[185],"demonstrate":[190],"effectiveness":[192],"convergence":[194],"proposed":[197],"algorithm.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}