A smoothing inexact Newton method for generalized nonlinear complementarity problem (Q1954743): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hai-Tao Che / rank
Normal rank
 
Property / author
 
Property / author: Hai-Tao Che / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/401835 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040952384 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58911534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Resolution of the Generalized Nonlinear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of the generalized complementarity problem to differentiable unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Trust Region Method for Solving Generalized Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing Newton-type method for generalized nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent Jacobian smoothing inexact Newton methods for NCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing inexact Newton method for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semismooth equation approach to the solution of nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth and Semiconvex Functions in Constrained Optimization / 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: A special newton-type optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalized Fischer-Burmeister NCP-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search / rank
 
Normal rank

Latest revision as of 12:54, 6 July 2024

scientific article
Language Label Description Also known as
English
A smoothing inexact Newton method for generalized nonlinear complementarity problem
scientific article

    Statements

    A smoothing inexact Newton method for generalized nonlinear complementarity problem (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2013
    0 references
    Summary: Based on the smoothing function of penalized Fischer-Burmeister NCP-function, we propose a new smoothing inexact Newton algorithm with non-monotone line search for solving the generalized nonlinear complementarity problem. We view the smoothing parameter as an independent variable. Under suitable conditions, we show that any accumulation point of the generated sequence is a solution of the generalized nonlinear complementarity problem. We also establish the local superlinear (quadratic) convergence of the proposed algorithm under the BD-regular assumption. Preliminary numerical experiments indicate the feasibility and efficiency of the proposed algorithm.
    0 references
    0 references
    0 references
    0 references