ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A triangulation of the nonnegative orthant and a special labeling of the vertices lead to a combinatorial procedure for seeking solutions or approximate solutions to the nonlinear complementarity problem under coercive-like assumptions on the problem functions. Derivatives are not required. Convergence is proved, computational considerations are discussed, and some preliminary applications to convex programming and saddle point computation, along with numerical results, are presented.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580246