Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem (Q619752)

From MaRDI portal
Revision as of 01:54, 2 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem
scientific article

    Statements

    Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem (English)
    0 references
    0 references
    0 references
    18 January 2011
    0 references
    The generalized nonlinear complementarity problem (GNCP) is reformulated as a system of nonlinear equations. A smoothing Broyden-like algorithm based on the smoothing Fischer-Burmeister function is introduced to solve the GNCP over a polyhedral cone. The algorithm solves one system of nonhomogeneous linear equations, performs one line search and updates one matrix per iteration. The global convergence of the proposed algorithm is proved under suitable condition, and the local superlinear/quadratic convergence is established under certain assumptions. Some numerical examples are presented to illustrate the efficiency of the algorithm.
    0 references
    0 references
    generalized nonlinear complementarity problem
    0 references
    smoothing Broyden-like method
    0 references
    global convergence
    0 references
    superlinear/quadratic convergence
    0 references
    numerical examples
    0 references
    algorithm
    0 references