Sciweavers

Share
MP
2002

A feasible semismooth asymptotically Newton method for mixed complementarity problems

9 years 3 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible methods. However, some MCPs are not well defined outside the feasible region or the equivalent unconstrained reformulations of other MCPs contain local minimizers outside the feasible region. As both these problems could make the corresponding infeasible methods fail, more recent attention is on feasible methods. In this paper we propose a new feasible semismooth method for MCPs, in which the search direction asymptotically converges to the Newton direction. The new method overcomes the possible non-convergence of the projected semismooth Newton method, which is widely used in various numerical implementations, by minimizing a one-dimensional quadratic convex problem prior to doing (curved) line searches. As with other semismooth Newton methods, the proposed method only solves one linear system of equations at ...
Defeng Sun, Robert S. Womersley, Houduo Qi
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where MP
Authors Defeng Sun, Robert S. Womersley, Houduo Qi
Comments (0)
books