{"id":"https://openalex.org/W2067313264","doi":"https://doi.org/10.1137/070702497","title":"A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping","display_name":"A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2067313264","doi":"https://doi.org/10.1137/070702497","mag":"2067313264"},"language":"en","primary_location":{"id":"doi:10.1137/070702497","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070702497","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":false,"raw_author_name":"Hideaki Iiduka","raw_affiliation_strings":["iiduka@ndrc.kyutech.ac.jp#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"iiduka@ndrc.kyutech.ac.jp#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103022814","display_name":"Isao Yamada","orcid":"https://orcid.org/0000-0002-6563-7526"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Isao Yamada","raw_affiliation_strings":["isao@comm.ss.titech.ac.jp#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"isao@comm.ss.titech.ac.jp#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.9413,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.98443309,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"19","issue":"4","first_page":"1881","last_page":"1893"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9983999729156494,"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.9908999800682068,"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/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.796839714050293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7355525493621826},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6912372708320618},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6529663801193237},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6085590720176697},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5727302432060242},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.5454162359237671},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5438019633293152},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5330117344856262},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48568663001060486},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.4707736670970917},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4538503885269165},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4422880709171295},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43564945459365845},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.4345170855522156},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43323081731796265},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.42166414856910706},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.41895249485969543},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.2905411720275879},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21198835968971252},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06578800082206726},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.060292720794677734},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.053406208753585815}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.796839714050293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7355525493621826},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6912372708320618},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6529663801193237},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6085590720176697},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5727302432060242},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.5454162359237671},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5438019633293152},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5330117344856262},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48568663001060486},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.4707736670970917},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4538503885269165},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4422880709171295},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43564945459365845},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.4345170855522156},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43323081731796265},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.42166414856910706},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.41895249485969543},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2905411720275879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21198835968971252},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06578800082206726},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.060292720794677734},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.053406208753585815},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070702497","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070702497","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1972922100","https://openalex.org/W1975553457","https://openalex.org/W1986082458","https://openalex.org/W1988849934","https://openalex.org/W1992586477","https://openalex.org/W1995409333","https://openalex.org/W1998762105","https://openalex.org/W2012231377","https://openalex.org/W2012960907","https://openalex.org/W2014851363","https://openalex.org/W2018332842","https://openalex.org/W2030071347","https://openalex.org/W2033511209","https://openalex.org/W2040006905","https://openalex.org/W2091549324","https://openalex.org/W2108560279","https://openalex.org/W2115321886","https://openalex.org/W2126776700","https://openalex.org/W2132614631","https://openalex.org/W2138146018","https://openalex.org/W2158894942","https://openalex.org/W2254398807","https://openalex.org/W2316564661","https://openalex.org/W4254357484","https://openalex.org/W4254573171"],"related_works":["https://openalex.org/W4319027779","https://openalex.org/W2348618647","https://openalex.org/W2390078254","https://openalex.org/W2604655597","https://openalex.org/W2947596922","https://openalex.org/W2364021889","https://openalex.org/W2379322359","https://openalex.org/W1993524345","https://openalex.org/W1999446604","https://openalex.org/W2356365850"],"abstract_inverted_index":{"In":[0,60],"this":[1,36],"paper,":[2],"we":[3,38,73],"discuss":[4],"the":[5,10,22,27,33,46,53,64,78,81],"convex":[6],"optimization":[7],"problem":[8],"over":[9],"fixed":[11],"point":[12],"set":[13],"of":[14,21,69,77],"a":[15,40],"nonexpansive":[16],"mapping.":[17],"The":[18],"main":[19],"objective":[20],"paper":[23],"is":[24,55],"to":[25,52,62],"accelerate":[26],"hybrid":[28],"steepest":[29],"descent":[30],"method":[31],"for":[32],"problem.":[34],"To":[35],"goal,":[37],"present":[39,74],"new":[41],"iterative":[42],"scheme":[43],"that":[44],"utilizes":[45],"conjugate":[47],"gradient":[48],"direction.":[49],"Its":[50],"convergence":[51,68],"solution":[54],"guaranteed":[56],"under":[57],"certain":[58],"assumptions.":[59],"order":[61],"demonstrate":[63],"effectiveness,":[65],"performance,":[66],"and":[67],"our":[70],"proposed":[71],"algorithm,":[72],"numerical":[75],"comparisons":[76],"algorithm":[79],"with":[80],"existing":[82],"algorithm.":[83]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}