A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447)
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 1586152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> |
scientific article; zbMATH DE number 1586152 |
Statements
A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (English)
0 references
27 November 2001
0 references
interior point algorithms
0 references
nonlinear monotone complementarity problems
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8515167832374573
0 references
0.8492244482040405
0 references
0.830771803855896
0 references
0.8280086517333984
0 references
Many interior point algorithms have been proposed for solving nonlinear monotone complementarity problems. Some of them have polynomial worst-case complexity but have to confine to short steps, whereas some of others can take long steps but no polynoial complexity is proven. This paper presents an algorithm which is both long-step and polynomial. In addition, the sequence generated by algorithm converges quadratically. The proof of the polynomial complexity requires that the monotone mapping satisfies a scaled Lipschitz condition, while the quadratic rate of convergence is derived under the assumptions that the problem has a strictly complementary solution and that the Jacobian of the mapping satisfies certain regularity conditions.
0 references