求解广义互补问题的最小变化正割算法

IF 1.7 3区数学 Q2 MATHEMATICS, APPLIED

Numerical Algorithms Pub Date : 2024-08-28 DOI:10.1007/s11075-024-01870-4

H. Vivas, R. Pérez, C. Arias

引用次数: 0

摘要

在本文中，我们提出了一种最小变化正割算法，通过将广义互补问题重构为非光滑非线性方程组，使用互补函数的单参数族间接求解广义互补问题。我们给出了新算法的局部和超线性收敛结果，并分析了其数值性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

A least-change secant algorithm for solving generalized complementarity problem

查看原文本刊更多论文

A least-change secant algorithm for solving generalized complementarity problem

In this paper, we propose a least-change secant algorithm to solve the generalized complementarity problem indirectly trough its reformulation as a nonsmooth system of nonlinear equations using a one-parametric family of complementarity functions. We present local and superlinear convergence results of new algorithm and analyze its numerical performance.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Numerical Algorithms 数学-应用数学

CiteScore

4.00

自引率

9.50%

发文量

201

审稿时长

9 months

期刊介绍： The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.