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

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research 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.

求助全文

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

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.