{"id":"https://openalex.org/W2171417898","doi":"https://doi.org/10.1080/00207160212112","title":"GSOR Method for the Equality Constrained Least Squares Problems and the Generalized Least Squares Problems","display_name":"GSOR Method for the Equality Constrained Least Squares Problems and the Generalized Least Squares Problems","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2171417898","doi":"https://doi.org/10.1080/00207160212112","mag":"2171417898"},"language":"en","primary_location":{"id":"doi:10.1080/00207160212112","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160212112","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/A5101876245","display_name":"Changjun Li","orcid":"https://orcid.org/0000-0003-1272-3487"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]},{"id":"https://openalex.org/I142078773","display_name":"Shenyang Institute of Automation","ror":"https://ror.org/00ft6nj33","country_code":"CN","type":"facility","lineage":["https://openalex.org/I142078773","https://openalex.org/I19820366"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Changjun Li","raw_affiliation_strings":["a   Shenyang Institute of Automation , Chinese Academy of Sciences","b  Northeastern University ,  Shenyang ,  China","Northeastern University , Shenyang , China","Shenyang Institute of Automation , Chinese Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"a   Shenyang Institute of Automation , Chinese Academy of Sciences","institution_ids":["https://openalex.org/I142078773"]},{"raw_affiliation_string":"b  Northeastern University ,  Shenyang ,  China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"Northeastern University , Shenyang , China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"Shenyang Institute of Automation , Chinese Academy of Sciences","institution_ids":["https://openalex.org/I142078773","https://openalex.org/I19820366"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103518679","display_name":"D. J. Evans","orcid":null},"institutions":[{"id":"https://openalex.org/I52590639","display_name":"Nottingham Trent University","ror":"https://ror.org/04xyxjd90","country_code":"GB","type":"education","lineage":["https://openalex.org/I52590639"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David J. Evans","raw_affiliation_strings":["c  Nottingham Trent University ,  Nottingham ,  UK","Nottingham Trent University , Nottingham , UK"],"affiliations":[{"raw_affiliation_string":"c  Nottingham Trent University ,  Nottingham ,  UK","institution_ids":["https://openalex.org/I52590639"]},{"raw_affiliation_string":"Nottingham Trent University , Nottingham , UK","institution_ids":["https://openalex.org/I52590639"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101876245"],"corresponding_institution_ids":["https://openalex.org/I142078773","https://openalex.org/I19820366","https://openalex.org/I9224756"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.24210031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"79","issue":"8","first_page":"955","last_page":"960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9958000183105469,"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.9958000183105469,"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.9916999936103821,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9660999774932861,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8466899991035461},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.7737365365028381},{"id":"https://openalex.org/keywords/non-linear-least-squares","display_name":"Non-linear least squares","score":0.7290551066398621},{"id":"https://openalex.org/keywords/iteratively-reweighted-least-squares","display_name":"Iteratively reweighted least squares","score":0.666027307510376},{"id":"https://openalex.org/keywords/generalized-least-squares","display_name":"Generalized least squares","score":0.660020649433136},{"id":"https://openalex.org/keywords/total-least-squares","display_name":"Total least squares","score":0.6596681475639343},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5285362601280212},{"id":"https://openalex.org/keywords/recursive-least-squares-filter","display_name":"Recursive least squares filter","score":0.45416340231895447},{"id":"https://openalex.org/keywords/least-trimmed-squares","display_name":"Least trimmed squares","score":0.4343598484992981},{"id":"https://openalex.org/keywords/linear-least-squares","display_name":"Linear least squares","score":0.42891865968704224},{"id":"https://openalex.org/keywords/lack-of-fit-sum-of-squares","display_name":"Lack-of-fit sum of squares","score":0.42304131388664246},{"id":"https://openalex.org/keywords/explained-sum-of-squares","display_name":"Explained sum of squares","score":0.41115429997444153},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40533220767974854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2600358724594116},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15212878584861755}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8466899991035461},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.7737365365028381},{"id":"https://openalex.org/C45923927","wikidata":"https://www.wikidata.org/wiki/Q3319230","display_name":"Non-linear least squares","level":3,"score":0.7290551066398621},{"id":"https://openalex.org/C126090379","wikidata":"https://www.wikidata.org/wiki/Q6094424","display_name":"Iteratively reweighted least squares","level":4,"score":0.666027307510376},{"id":"https://openalex.org/C188649462","wikidata":"https://www.wikidata.org/wiki/Q2246261","display_name":"Generalized least squares","level":3,"score":0.660020649433136},{"id":"https://openalex.org/C169241690","wikidata":"https://www.wikidata.org/wiki/Q7828122","display_name":"Total least squares","level":3,"score":0.6596681475639343},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5285362601280212},{"id":"https://openalex.org/C145249878","wikidata":"https://www.wikidata.org/wiki/Q2835868","display_name":"Recursive least squares filter","level":3,"score":0.45416340231895447},{"id":"https://openalex.org/C25294789","wikidata":"https://www.wikidata.org/wiki/Q6510410","display_name":"Least trimmed squares","level":4,"score":0.4343598484992981},{"id":"https://openalex.org/C58663186","wikidata":"https://www.wikidata.org/wiki/Q6553462","display_name":"Linear least squares","level":3,"score":0.42891865968704224},{"id":"https://openalex.org/C166811707","wikidata":"https://www.wikidata.org/wiki/Q6468669","display_name":"Lack-of-fit sum of squares","level":4,"score":0.42304131388664246},{"id":"https://openalex.org/C49847556","wikidata":"https://www.wikidata.org/wiki/Q3964631","display_name":"Explained sum of squares","level":2,"score":0.41115429997444153},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40533220767974854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2600358724594116},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15212878584861755},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.0},{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207160212112","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160212112","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"},{"id":"pmh:oai:irep.ntu.ac.uk:24917","is_oa":false,"landing_page_url":"http://irep.ntu.ac.uk/id/eprint/24917/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400559","display_name":"Nottingham Trent University's Institutional Repository (Nottingham Trent Repository)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I52590639","host_organization_name":"Nottingham Trent University","host_organization_lineage":["https://openalex.org/I52590639"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.47999998927116394,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1965327386","https://openalex.org/W1969290389","https://openalex.org/W2010315317","https://openalex.org/W2014824478","https://openalex.org/W2247539461","https://openalex.org/W2588081979","https://openalex.org/W4299343067","https://openalex.org/W4302564868"],"related_works":["https://openalex.org/W4387810207","https://openalex.org/W1500807766","https://openalex.org/W3150673294","https://openalex.org/W2388513917","https://openalex.org/W4380487384","https://openalex.org/W1546276525","https://openalex.org/W2034819163","https://openalex.org/W79007405","https://openalex.org/W2368345218","https://openalex.org/W1522321652"],"abstract_inverted_index":{"In":[0,21],"a":[1,10],"recent":[2],"paper":[3],"[4],":[4],"Li":[5],"et":[6],"al":[7],".":[8],"gave":[9],"generalized":[11,43],"successive":[12],"overrelaxation":[13],"(GSOR)":[14],"method":[15,29],"for":[16],"the":[17,27,34,42],"least":[18,37,44],"squares":[19,38,45],"problems.":[20,47],"this":[22],"paper,":[23],"we":[24],"show":[25],"that":[26],"GSOR":[28],"can":[30],"be":[31],"applied":[32],"to":[33],"equality":[35],"constrained":[36],"(LSE)":[39],"problems":[40],"and":[41],"(GLS)":[46]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}