{"id":"https://openalex.org/W2704581149","doi":"https://doi.org/10.1109/icassp.2017.7953050","title":"Accelerating the hybrid steepest descent method for affinely constrained convex composite minimization tasks","display_name":"Accelerating the hybrid steepest descent method for affinely constrained convex composite minimization tasks","publication_year":2017,"publication_date":"2017-03-01","ids":{"openalex":"https://openalex.org/W2704581149","doi":"https://doi.org/10.1109/icassp.2017.7953050","mag":"2704581149"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2017.7953050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2017.7953050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5042922973","display_name":"Konstantinos Slavakis","orcid":"https://orcid.org/0000-0002-3370-3154"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Konstantinos Slavakis","raw_affiliation_strings":["Dept. of Electrical Eng., University at Buffalo (SUNY), Buffalo, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Eng., University at Buffalo (SUNY), Buffalo, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103022814","display_name":"Isao Yamada","orcid":"https://orcid.org/0000-0002-6563-7526"},"institutions":[{"id":"https://openalex.org/I90023481","display_name":"National Institute of Information and Communications Technology","ror":"https://ror.org/016bgq349","country_code":"JP","type":"facility","lineage":["https://openalex.org/I90023481"]},{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Isao Yamada","raw_affiliation_strings":["Dept. of Inform. & Communications Eng., Tokyo Institute of Technology, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. of Inform. & Communications Eng., Tokyo Institute of Technology, Tokyo, Japan","institution_ids":["https://openalex.org/I90023481","https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040341698","display_name":"Shunsuke Ono","orcid":"https://orcid.org/0000-0001-7890-5131"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shunsuke Ono","raw_affiliation_strings":["Tokyo Institute of Technology, Lab. Future Interdisciplinary Research of Sc. & Tech., Yokohama, Japan"],"affiliations":[{"raw_affiliation_string":"Tokyo Institute of Technology, Lab. Future Interdisciplinary Research of Sc. & Tech., Yokohama, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042922973"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10499118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":null,"first_page":"4711","last_page":"4715"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9980000257492065,"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.9980000257492065,"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.9957000017166138,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.989300012588501,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6023939847946167},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.5156951546669006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.503743588924408},{"id":"https://openalex.org/keywords/method-of-steepest-descent","display_name":"Method of steepest descent","score":0.5000786781311035},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.4393683969974518},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.4305621087551117},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42280811071395874},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4214995205402374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4087812006473541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3937109708786011},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.26590633392333984},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08341541886329651}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6023939847946167},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.5156951546669006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.503743588924408},{"id":"https://openalex.org/C158847443","wikidata":"https://www.wikidata.org/wiki/Q1997812","display_name":"Method of steepest descent","level":2,"score":0.5000786781311035},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.4393683969974518},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.4305621087551117},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42280811071395874},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4214995205402374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4087812006473541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3937109708786011},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.26590633392333984},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08341541886329651},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2017.7953050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2017.7953050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1546168022","https://openalex.org/W1571416372","https://openalex.org/W1627780903","https://openalex.org/W1986080131","https://openalex.org/W1998428773","https://openalex.org/W1998991750","https://openalex.org/W2000512760","https://openalex.org/W2009745212","https://openalex.org/W2014823423","https://openalex.org/W2020532300","https://openalex.org/W2045079045","https://openalex.org/W2055576996","https://openalex.org/W2067313264","https://openalex.org/W2074209542","https://openalex.org/W2093425777","https://openalex.org/W2114423093","https://openalex.org/W2126776700","https://openalex.org/W2244987555","https://openalex.org/W2246091536","https://openalex.org/W2254398807","https://openalex.org/W2418010766","https://openalex.org/W2521112350","https://openalex.org/W2594914074","https://openalex.org/W4210665207","https://openalex.org/W4229650096","https://openalex.org/W4292363360","https://openalex.org/W6634001224","https://openalex.org/W6734379469"],"related_works":["https://openalex.org/W4221091651","https://openalex.org/W1968854694","https://openalex.org/W2037152550","https://openalex.org/W2379024323","https://openalex.org/W2029398639","https://openalex.org/W1992322822","https://openalex.org/W40310133","https://openalex.org/W2124505441","https://openalex.org/W1995174127","https://openalex.org/W2752856719"],"abstract_inverted_index":{"The":[0,79],"hybrid":[1],"steepest":[2],"descent":[3],"method":[4,73],"(HSDM)":[5],"[Yamada,":[6],"'01]":[7],"was":[8],"introduced":[9],"as":[10],"a":[11,110,140,143,155],"low-computational":[12],"complexity":[13],"tool":[14],"for":[15,44,85,181],"solving":[16],"convex":[17,56,136],"variational-inequality":[18],"problems":[19,66],"over":[20,59,116],"the":[21,45,48,62,69,102,131,147,174,178],"fixed-point":[22],"set":[23],"of":[24,50,65,74,101,105,121,177],"non-expansive":[25],"mappings":[26],"in":[27,97],"Hilbert":[28],"spaces.":[29],"Motivated":[30],"by":[31,68],"results":[32],"on":[33,126,166,170],"decentralized":[34],"optimization,":[35],"this":[36],"study":[37],"introduces":[38],"an":[39],"HSDM":[40,51,103],"variant":[41],"that":[42,89],"extends,":[43],"first":[46],"time,":[47],"applicability":[49],"to":[52,133,153],"affinely":[53],"constrained":[54],"composite":[55],"minimization":[57],"tasks":[58,88],"Euclidean":[60],"spaces;":[61],"same":[63],"class":[64],"solved":[67],"popular":[70],"alternating":[71],"direction":[72],"multipliers":[75],"and":[76,130,142,160,169],"primal-dual":[77],"methods.":[78],"proposed":[80,179],"scheme":[81,180],"shows":[82],"desirable":[83],"attributes":[84],"large-scale":[86,182],"optimization":[87,183],"have":[90,154],"not":[91],"been":[92],"met,":[93],"partly":[94],"or":[95],"all-together,":[96],"any":[98],"other":[99],"member":[100],"family":[104],"algorithms:":[106],"tunable":[107],"computational":[108],"complexity,":[109],"step-size":[111],"parameter":[112],"which":[113,138],"stays":[114],"constant":[115],"recursions,":[117],"promoting":[118],"thus":[119],"acceleration":[120],"convergence,":[122],"no":[123],"boundedness":[124],"constraints":[125],"iterates":[127],"and/or":[128],"gradients,":[129],"ability":[132],"deal":[134],"with":[135],"losses":[137],"comprise":[139],"smooth":[141,148],"non-smooth":[144],"part,":[145],"where":[146],"part":[149],"is":[150],"only":[151],"required":[152],"Lipschitz-continuous":[156],"derivative.":[157],"Convergence":[158],"guarantees":[159],"rates":[161],"are":[162],"established.":[163],"Numerical":[164],"tests":[165],"synthetic":[167],"data":[168],"colored-image":[171],"inpainting":[172],"underline":[173],"rich":[175],"potential":[176],"tasks.":[184]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}