A globally convergent method for solving nonlinear equations without the differentiability condition (Q2564500): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent algorithm for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of convergence of a generalization of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured and simultaneous Lyapunov functions for system stability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence analysis of tensor methods for nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue perturbations and nonlinear parametric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable optimization algorithm for designing control systems having singular value inequalities / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02143127 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089133473 / rank
 
Normal rank

Latest revision as of 11:05, 30 July 2024

scientific article
Language Label Description Also known as
English
A globally convergent method for solving nonlinear equations without the differentiability condition
scientific article

    Statements

    A globally convergent method for solving nonlinear equations without the differentiability condition (English)
    0 references
    0 references
    21 April 1997
    0 references
    The author provides a general iterative method which computes the maximal real root \(x_{\max}\) of a one-variable Lipschitzian function in a given interval. It is shown that the method is globally convergent provided that some real parameter or the algorithm has been chosen appropriately. [There are Lipschitz functions for which it is known that it is difficult to find their zeros. Therefore, a big portion of the difficulties is transported to the determination of an appropriate parameter].
    0 references
    zeros of functions
    0 references
    global convergence
    0 references
    iterative method
    0 references
    maximal real root
    0 references

    Identifiers