Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0835.90102
Mangasarian, O.L.
The linear complementarity problem as a separable bilinear program. (English)
[J] J. Glob. Optim. 6, No.2, 153-161 (1995). ISSN 0925-5001; ISSN 1573-2916/e

Summary: The nonmonotone linear complementarity problem (LCP) is formulated as a bilinear program with separable constraints and an objective function that minimizes a natural error residual for the LCP. A linear- programming-based algorithm applied to the bilinear program terminates in a finite number of steps at a solution or stationary point of the problem. The bilinear algorithm solved 80 consecutive cases of the LCP formulation of the knapsack feasibility problem ranging in size between 10 and 3000, with almost constant average number of major iterations equal to four.

MSC 2000:: *90C33 Complementarity problems
90C20 Quadratic programming

Keywords: nonmonotone linear complementarity problem; bilinear program; separable constraints; knapsack feasibility problem

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]