{"id":"https://openalex.org/W2167835809","doi":"https://doi.org/10.1080/00207160.2014.996557","title":"On the restrictively preconditioned conjugate gradient method for solving saddle point problems","display_name":"On the restrictively preconditioned conjugate gradient method for solving saddle point problems","publication_year":2014,"publication_date":"2014-12-10","ids":{"openalex":"https://openalex.org/W2167835809","doi":"https://doi.org/10.1080/00207160.2014.996557","mag":"2167835809"},"language":"en","primary_location":{"id":"doi:10.1080/00207160.2014.996557","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2014.996557","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","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/A5015562737","display_name":"Xiaofei Peng","orcid":"https://orcid.org/0000-0002-8953-1478"},"institutions":[{"id":"https://openalex.org/I187400657","display_name":"South China Normal University","ror":"https://ror.org/01kq0pv72","country_code":"CN","type":"education","lineage":["https://openalex.org/I187400657"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiao-Fei Peng","raw_affiliation_strings":["School of Software, South China Normal University, Foshan528225, China"],"affiliations":[{"raw_affiliation_string":"School of Software, South China Normal University, Foshan528225, China","institution_ids":["https://openalex.org/I187400657"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101449372","display_name":"Wen Li","orcid":"https://orcid.org/0000-0002-8491-0014"},"institutions":[{"id":"https://openalex.org/I187400657","display_name":"South China Normal University","ror":"https://ror.org/01kq0pv72","country_code":"CN","type":"education","lineage":["https://openalex.org/I187400657"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wen Li","raw_affiliation_strings":["School of Mathematical Sciences, South China Normal University, Guangzhou510631, China"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, South China Normal University, Guangzhou510631, China","institution_ids":["https://openalex.org/I187400657"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015562737"],"corresponding_institution_ids":["https://openalex.org/I187400657"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.16381308,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"93","issue":"1","first_page":"142","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998000264167786,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998000264167786,"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/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9994000196456909,"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/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.8730490803718567},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.865429162979126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5905986428260803},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.5785247087478638},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5597044229507446},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5554072260856628},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5508952140808105},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.5252299308776855},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.4646690785884857},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4495398998260498},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4438120424747467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3555740416049957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3515010476112366},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2151152491569519},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.11093258857727051},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.062349021434783936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05490309000015259}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.8730490803718567},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.865429162979126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5905986428260803},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.5785247087478638},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5597044229507446},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5554072260856628},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5508952140808105},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.5252299308776855},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.4646690785884857},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4495398998260498},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4438120424747467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3555740416049957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3515010476112366},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2151152491569519},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.11093258857727051},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.062349021434783936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05490309000015259},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160.2014.996557","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2014.996557","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","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":20,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W1666670079","https://openalex.org/W1966886095","https://openalex.org/W1970870428","https://openalex.org/W1992208469","https://openalex.org/W2002673363","https://openalex.org/W2004789423","https://openalex.org/W2018514932","https://openalex.org/W2018850201","https://openalex.org/W2019490405","https://openalex.org/W2064616889","https://openalex.org/W2072118131","https://openalex.org/W2078843646","https://openalex.org/W2129625121","https://openalex.org/W2133248904","https://openalex.org/W2136722618","https://openalex.org/W2141870784","https://openalex.org/W2316564661","https://openalex.org/W2610857016","https://openalex.org/W3100429042"],"related_works":["https://openalex.org/W2098528027","https://openalex.org/W2005717169","https://openalex.org/W3159557833","https://openalex.org/W2183734858","https://openalex.org/W3159907817","https://openalex.org/W2060532089","https://openalex.org/W2388344948","https://openalex.org/W4319027779","https://openalex.org/W3123621400","https://openalex.org/W3082608044"],"abstract_inverted_index":{"Bai":[0],"et":[1],"al.":[2],"[2003,":[3],"IMA":[4],"J":[5],"Numer.":[6],"Anal.":[7],"23,":[8],"561\u2013580]":[9],"proposed":[10,105],"the":[11,23,32,48,58,70,77,82,91,96,101,104],"restrictively":[12],"preconditioned":[13],"conjugate":[14],"gradient":[15],"(RPCG)":[16],"method.":[17],"In":[18,85],"this":[19],"paper,":[20],"based":[21],"on":[22],"special":[24],"structure":[25],"of":[26,57,69,103],"saddle":[27],"point":[28],"systems,":[29],"we":[30],"consider":[31],"RPCG":[33,71],"method":[34,51,72],"and":[35],"propose":[36],"a":[37,53],"new":[38,41,67],"format.":[39,106],"This":[40],"format":[42,68],"can":[43,73],"be":[44],"obtained":[45],"by":[46],"applying":[47],"classical":[49],"PCG":[50],"to":[52],"simpler":[54],"system":[55],"instead":[56],"original":[59,83],"format,":[60],"which":[61],"greatly":[62],"reduces":[63],"computational":[64],"cost.":[65],"The":[66],"often":[74],"attain":[75],"almost":[76],"same":[78],"convergence":[79],"rate":[80],"as":[81],"one.":[84],"particular,":[86],"for":[87],"some":[88],"practical":[89],"problems,":[90],"former":[92],"converges":[93],"faster":[94],"than":[95],"latter.":[97],"Numerical":[98],"experiments":[99],"show":[100],"efficiency":[102]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}