{"title":"A family of inertial‐based derivative‐free projection methods with a correction step for constrained nonlinear equations and their applications","authors":"Pengjie Liu, Hu Shao, Zihang Yuan, Jianhao Zhou","doi":"10.1002/nla.2533","DOIUrl":null,"url":null,"abstract":"Abstract Numerous attempts have been made to develop efficient methods for solving the system of constrained nonlinear equations due to its widespread use in diverse engineering applications. In this article, we present a family of inertial‐based derivative‐free projection methods with a correction step for solving such system, in which the selection of the derivative‐free search direction is flexible. This family does not require the computation of corresponding Jacobian matrix or approximate matrix at every iteration and possess the following theoretical properties: (i) the inertial‐based corrected direction framework always automatically satisfies the sufficient descent and trust region properties without specific search directions, and is independent of any line search; (ii) the global convergence of the proposed family is proven under a weaker monotonicity condition on the mapping , without the typical monotonicity or pseudo‐monotonicity assumption; (iii) the results about convergence rate of the proposed family are established under slightly stronger assumptions. Furthermore, we propose two effective inertial‐based derivative‐free projection methods, each embedding a specific search direction into the proposed family. We present preliminary numerical experiments on certain test problems to demonstrate the effectiveness and superiority of the proposed methods in comparison with existing ones. Additionally, we utilize these methods for solving sparse signal restorations and image restorations in compressive sensing applications.","PeriodicalId":49731,"journal":{"name":"Numerical Linear Algebra with Applications","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Linear Algebra with Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/nla.2533","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract Numerous attempts have been made to develop efficient methods for solving the system of constrained nonlinear equations due to its widespread use in diverse engineering applications. In this article, we present a family of inertial‐based derivative‐free projection methods with a correction step for solving such system, in which the selection of the derivative‐free search direction is flexible. This family does not require the computation of corresponding Jacobian matrix or approximate matrix at every iteration and possess the following theoretical properties: (i) the inertial‐based corrected direction framework always automatically satisfies the sufficient descent and trust region properties without specific search directions, and is independent of any line search; (ii) the global convergence of the proposed family is proven under a weaker monotonicity condition on the mapping , without the typical monotonicity or pseudo‐monotonicity assumption; (iii) the results about convergence rate of the proposed family are established under slightly stronger assumptions. Furthermore, we propose two effective inertial‐based derivative‐free projection methods, each embedding a specific search direction into the proposed family. We present preliminary numerical experiments on certain test problems to demonstrate the effectiveness and superiority of the proposed methods in comparison with existing ones. Additionally, we utilize these methods for solving sparse signal restorations and image restorations in compressive sensing applications.
期刊介绍:
Manuscripts submitted to Numerical Linear Algebra with Applications should include large-scale broad-interest applications in which challenging computational results are integral to the approach investigated and analysed. Manuscripts that, in the Editor’s view, do not satisfy these conditions will not be accepted for review.
Numerical Linear Algebra with Applications receives submissions in areas that address developing, analysing and applying linear algebra algorithms for solving problems arising in multilinear (tensor) algebra, in statistics, such as Markov Chains, as well as in deterministic and stochastic modelling of large-scale networks, algorithm development, performance analysis or related computational aspects.
Topics covered include: Standard and Generalized Conjugate Gradients, Multigrid and Other Iterative Methods; Preconditioning Methods; Direct Solution Methods; Numerical Methods for Eigenproblems; Newton-like Methods for Nonlinear Equations; Parallel and Vectorizable Algorithms in Numerical Linear Algebra; Application of Methods of Numerical Linear Algebra in Science, Engineering and Economics.