Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations (Q369446): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The authors introduce two derivative-free approaches for solving systems of nonlinear equations \(F(x)=0\), where \(F:\mathbb {R}^n\rightarrow \mathbb {R}^m\) is a continuous function satisfying the monotonicity condition \((F(x)-F(y))^T(x-y)\geq 0\), for all \(x,y\in \mathbb {R}\). First, they apply a backtracking line search along a specific direction to construct a new point. If it does not solve the problem, the projection technique is applied to construct an appropriate hyperplane strictly separating the current iterate from the solution of the problem. Then, the projection of this point onto the hyperplane is used as the next iterate. The authors prove the global convergence of the algorithm if the solution set of the problem is not empty and the function \(F(x)\) is Lipschitz continuous on \(\mathbb {R}^n\). Finally, they present the result of numerical experiments.
Property / review text: The authors introduce two derivative-free approaches for solving systems of nonlinear equations \(F(x)=0\), where \(F:\mathbb {R}^n\rightarrow \mathbb {R}^m\) is a continuous function satisfying the monotonicity condition \((F(x)-F(y))^T(x-y)\geq 0\), for all \(x,y\in \mathbb {R}\). First, they apply a backtracking line search along a specific direction to construct a new point. If it does not solve the problem, the projection technique is applied to construct an appropriate hyperplane strictly separating the current iterate from the solution of the problem. Then, the projection of this point onto the hyperplane is used as the next iterate. The authors prove the global convergence of the algorithm if the solution set of the problem is not empty and the function \(F(x)\) is Lipschitz continuous on \(\mathbb {R}^n\). Finally, they present the result of numerical experiments. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Przemysław Stpiczyński / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65H10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6210990 / rank
 
Normal rank
Property / zbMATH Keywords
 
system of nonlinear equations
Property / zbMATH Keywords: system of nonlinear equations / rank
 
Normal rank
Property / zbMATH Keywords
 
monotonicity property
Property / zbMATH Keywords: monotonicity property / rank
 
Normal rank
Property / zbMATH Keywords
 
derivative-free conjugate gradient approach
Property / zbMATH Keywords: derivative-free conjugate gradient approach / rank
 
Normal rank
Property / zbMATH Keywords
 
projection procedure
Property / zbMATH Keywords: projection procedure / rank
 
Normal rank
Property / zbMATH Keywords
 
line search technique
Property / zbMATH Keywords: line search technique / rank
 
Normal rank
Property / zbMATH Keywords
 
global convergence
Property / zbMATH Keywords: global convergence / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical experiments
Property / zbMATH Keywords: numerical experiments / rank
 
Normal rank

Revision as of 12:27, 28 June 2023

scientific article
Language Label Description Also known as
English
Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
scientific article

    Statements

    Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations (English)
    0 references
    0 references
    0 references
    0 references
    24 September 2013
    0 references
    The authors introduce two derivative-free approaches for solving systems of nonlinear equations \(F(x)=0\), where \(F:\mathbb {R}^n\rightarrow \mathbb {R}^m\) is a continuous function satisfying the monotonicity condition \((F(x)-F(y))^T(x-y)\geq 0\), for all \(x,y\in \mathbb {R}\). First, they apply a backtracking line search along a specific direction to construct a new point. If it does not solve the problem, the projection technique is applied to construct an appropriate hyperplane strictly separating the current iterate from the solution of the problem. Then, the projection of this point onto the hyperplane is used as the next iterate. The authors prove the global convergence of the algorithm if the solution set of the problem is not empty and the function \(F(x)\) is Lipschitz continuous on \(\mathbb {R}^n\). Finally, they present the result of numerical experiments.
    0 references
    system of nonlinear equations
    0 references
    monotonicity property
    0 references
    derivative-free conjugate gradient approach
    0 references
    projection procedure
    0 references
    line search technique
    0 references
    global convergence
    0 references
    algorithm
    0 references
    numerical experiments
    0 references

    Identifiers