A nonsmooth Levenberg-Marquardt method for vertical complementarity problems (Q1678591): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-017-0267-3 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4433566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected-gradient interior-point algorithm for complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of generalized differentials in nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CALCULATING AN ELEMENT OF B-DIFFERENTIAL FOR A VECTOR-VALUED MAXIMUM FUNCTION<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of an element of Clarke generalized Jacobian for a vector-valued max function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified two steps Levenberg-Marquardt method for nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameter-Self-Adjusting Levenberg-Marquardt Method for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-interior continuation method for generalized linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-017-0267-3 / rank
 
Normal rank

Latest revision as of 02:47, 11 December 2024

scientific article
Language Label Description Also known as
English
A nonsmooth Levenberg-Marquardt method for vertical complementarity problems
scientific article

    Statements

    A nonsmooth Levenberg-Marquardt method for vertical complementarity problems (English)
    0 references
    0 references
    0 references
    17 November 2017
    0 references
    In this paper, the vertical complementarity problem is studied. The problem is reformulated as a system of nonsmooth equations \(H(x)=0\). For solving this system, the nonsmooth Levenberg-Marquardt (LM) method with double parameter adjusting strategy is presented. The method is based on the computation of an element in the B-differential of a mapping \(H\) which along with a suitable choice of the LM parameter are the critical issues in the LM method. The LM parameter is adjusted based on the norm of the vector-valued minimum function and the ratio between the current and the predicted reductions. The authors investigate the computation of at least one element in the B-differential of \(H\) as it is necessary in the implementation of the algorithm, show the global convergence, and discuss the local convergence rate of the algorithm under the local error bound condition.
    0 references
    vertical complementarity problem
    0 references
    nonsmooth equations
    0 references
    nonsmooth analysis
    0 references
    Levenberg-Marquardt method
    0 references
    B-differential
    0 references
    global convergence
    0 references
    local convergence
    0 references
    local error bound condition
    0 references
    algorithms
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references