A new logarithmic-quadratic proximal method for nonlinear complementarity problems (Q732410)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5612848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new logarithmic-quadratic proximal method for nonlinear complementarity problems |
scientific article; zbMATH DE number 5612848 |
Statements
A new logarithmic-quadratic proximal method for nonlinear complementarity problems (English)
0 references
9 October 2009
0 references
The nonlinear complementarity problem can be formulated as finding the zero of an appropriately maximal monotone operator, which can be solved by the proximal point algorithm. In this paper a new logarithmic-quadratic proximal (LQP) method is proposed to solve nonlinear complementarity problems by using a new step size which can be obtained without the computation of the objective function. Each iteration contains a prediction and a correction. The predictor is obtained by solving the LQP system approximately under relaxed accuracy criterion. The global convergence of the proposed algorithm is established under some mild conditions. Two numerical examples are provided to illustrate the efficiency of the proposed algorithm.
0 references
nonlinear complementarity problems
0 references
pseudomonotone operators
0 references
interior proximal methods
0 references
predictor-corrector method
0 references
logarithmic-quadratic proximal method
0 references
global convergence
0 references
algorithm
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0 references
0.9269666075706482
0 references
0.9217171669006348
0 references
0.8858317732810974
0 references
0.8821836709976196
0 references
0.8810657262802124
0 references
