AN INEXACT RELAXED GENERALIZED NEWTON ITERATIVE METHOD FOR SOLVING GENERALIZED ABSOLUTE VALUE EQUATIONS

被引：0

作者：

Yu, Dongmei ^{[1
]}

Zhang, Yiming ^{[2
,3
]}

Yuan, Yifei ^{[4
]}

机构：

[1] Liaoning Tech Univ, Coll Sci Inst Optimizat & Decis Analyt, Sch Business Adm, Fuxin 123000, Peoples R China

[2] Liaoning Tech Univ, Sch Business Adm, Huludao 125105, Peoples R China

[3] Liaoning Tech Univ, Inst Optimizat & Decis Analyt, Fuxin 123000, Peoples R China

[4] Liaoning Tech Univ, Inst Optimizat & Decis Anal, Coll Sci, Fuxin 123000, Peoples R China

来源：

PACIFIC JOURNAL OF OPTIMIZATION | 2024年 / 20卷 / 01期

基金：

中国国家自然科学基金;

关键词：

generalized absolute value equations; generalized Newton method; relaxed; inexact; convergence; LINEAR COMPLEMENTARITY; VERTICAL-BAR; ALGORITHM; MODEL;

D O I：

暂无

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, for solving the generalized absolute value equations (GAVE), an inexact relaxed generalized Newton (IRGN) iterative method is developed, which can adopt a relative error tolerance. Linear convergence of the IRGN iterative method is established under suitable conditions, and theoretical analysis of the inexact schemes support the efficient computational implementations of the exact schemes. It has been found that the IRGN iterative method involves the classical generalized Newton (GN) iterative method as a special case. Some numerical results are given to demonstrate the viability and robustness of the proposed methods.

引用

页码：23 / 44

页数：22

共 45 条

[21] Absolute value equation solution via concave minimization [J].

Mangasarian, O. L. .

OPTIMIZATION LETTERS, 2007, 1 (01) :3-8

[22] Knapsack feasibility as an absolute value equation solvable by successive linear programming [J].

Mangasarian, O. L. .

OPTIMIZATION LETTERS, 2009, 3 (02) :161-170

[23] Linear complementarity as absolute value equation solution [J].

Mangasarian, Olvi L. .

OPTIMIZATION LETTERS, 2014, 8 (04) :1529-1534

[24] An Efficient Neural Network Model for Solving the Absolute Value Equations [J].

Mansoori, Amin ;

Eshaghnezhad, Mohammad ;

Effati, Sohrab .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2018, 65 (03) :391-395

[25] A dynamic model to solve the absolute value equations [J].

Mansoori, Amin ;

Erfanian, Majid .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 333 :28-35

[26] On the solution of general absolute value equations [J].

Mezzadri, Francesco .

APPLIED MATHEMATICS LETTERS, 2020, 107

[27] Optimal correction of the absolute value equations [J].

Moosaei, Hossein ;

Ketabchi, Saeed ;

Hladik, Milan .

JOURNAL OF GLOBAL OPTIMIZATION, 2021, 79 (03) :645-667

[28] LSQR - AN ALGORITHM FOR SPARSE LINEAR-EQUATIONS AND SPARSE LEAST-SQUARES [J].

PAIGE, CC ;

SAUNDERS, MA .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1982, 8 (01) :43-71

[29] On equivalent reformulations for absolute value equations [J].

Prokopyev, Oleg .

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2009, 44 (03) :363-372

[30] SYSTEMS OF LINEAR INTERVAL EQUATIONS [J].

ROHN, J .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 126 :39-78

← 1 2 3 4 5 →