Results 1 
6 of
6
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
A Quadratically Convergent Algorithm for the Generalized Linear Complementarity Problem[J
 International Mathematical Forum
"... In this paper, the generalized linear complementarity problem (GLCP) is reformulated as a system of nonsmooth equations via the Fischer function. Based on this reformulation, the famous LevenbergMarquardt(LM) algorithm is employed for obtaining its solution. Theoretical results that relate the st ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
the stationary points of the merit function to the solution of the GLCP are presented. We show that the LM algorithm is both globally and Quadratically convergent without nondegenerate solution. Moreover, a method to calculate a generalized Jacobian is also given.
On the Extended Linear Complementarity Problem
 MATHEMATICAL PROGRAMMING
, 1996
"... For the extended linear complementarity problem [11], we introduce and characterize columnsufficiency, rowsufficiency, and Pproperties. These properties are then specialized to the vertical, horizontal, and mixed linear complementarity problems. ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
For the extended linear complementarity problem [11], we introduce and characterize columnsufficiency, rowsufficiency, and Pproperties. These properties are then specialized to the vertical, horizontal, and mixed linear complementarity problems.
A Damped GuassNewton Method for the Generalized Linear Complementarity Problem
"... Abstractâ€”In this paper, we consider the generalized linear complementarity problem (GLCP) over an affine subspace. To this end, we first reformulate the GLCP as a system of nonsmooth equation via the Fischer function. Based on this reformulation, the famous damped GaussNewton (DGN) algorithm is emp ..."
Abstract
 Add to MetaCart
is employed for obtaining its solution, and we show that the DGN algorithm is quadratically convergent without nondegenerate solution. Some numerical experiments of the algorithm are also reported in this paper. Keywords GLCP; DGN algorithm; quadratical convergence I.
CONTRIBUTIONS TO THE THEORY OF. DISTANCE REGULAR GRAPHS E.W. LAMBECK CONTRIBUTIONS TO THE THEORY OF DISTANCE REGULAR GRAPHS CONTRffiUTIONS TO THE THEORY OF DISTANCE REGULAR GRAPHS
"... een commissie aangewezen door het College van Dekanen in het openbaar te verdedigen op dinsdag 6 november 1990 te 16.00 uur door ERNST WILLEM LAMBECK ..."
Abstract
 Add to MetaCart
een commissie aangewezen door het College van Dekanen in het openbaar te verdedigen op dinsdag 6 november 1990 te 16.00 uur door ERNST WILLEM LAMBECK