检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Debora Cores Johanna Figueroa
机构地区:[1]Defense University Center at the Spanish Naval Academy,Plaza de Espana,36920 Marin,Pontevedra,Spain [2]Departamento de Matematica,Facultad de Matematica,Pontificia Universidad Catolica de Chile,Av.Vicuna Mackenna 4860,San Joaquin,Santiago 894000,Chile
出 处:《Journal of Computational Mathematics》2024年第4期932-954,共23页计算数学(英文)
摘 要:Recently,the authors proposed a low-cost approach,named Optimization Approach for Linear Systems(OPALS)for solving any kind of a consistent linear system regarding the structure,characteristics,and dimension of the coefficient matrix A.The results obtained by this approach for matrices with no structure and with indefinite symmetric part were encouraging when compare with other recent and well-known techniques.In this work,we proposed to extend the OPALS approach for solving the Linear Least-Squares Problem(LLSP)and the Minimum Norm Linear System Problem(MNLSP)using any iterative low-cost gradient-type method,avoiding the construction of the matrices AT A or AAT,and taking full advantage of the structure and form of the gradient of the proposed nonlinear objective function in the gradient direction.The combination of those conditions together with the choice of the initial iterate allow us to produce a novel and efficient low-cost numerical scheme for solving both problems.Moreover,the scheme presented in this work can also be used and extended for the weighted minimum norm linear systems and minimum norm linear least-squares problems.We include encouraging numerical results to illustrate the practical behavior of the proposed schemes.
关 键 词:Nonlinear convex optimization Gradient-type methods Spectral gradient method Minimum norm solution linear systems Linear least-squares solution
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117