A note on a quadratic formulation for linear complementarity problems (Q1090251): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of symmetric linear complementarity problems by iterative methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A dual differentiable exact penalty function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the Linear Complementarity Problem in Circuit Simulation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4171531 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Iterative Methods for Large Convex Quadratic Programs: A Survey / rank | |||
Normal rank | |||
Latest revision as of 19:04, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on a quadratic formulation for linear complementarity problems |
scientific article |
Statements
A note on a quadratic formulation for linear complementarity problems (English)
0 references
1988
0 references
We discuss some properties of a quadratic formulation for linear complementarity problems. Projected SOR methods proposed by Mangasarian apply to symmetric matrices only. The quadratic formulation discussed here makes it possible to use these SOR methods for solving nonsymetric LCPs. SOR schemes based on this formulation preserve sparsity. For proper choice of a free parameter, this quadratic formulation also preserves convexity. The value of the quadratic function for the solution of original LCP is also known.
0 references
quadratic formulation
0 references
linear complementarity
0 references
