A conical algorithm for solving a class of complementarity problems (Q1089269): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:10, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A conical algorithm for solving a class of complementarity problems |
scientific article |
Statements
A conical algorithm for solving a class of complementarity problems (English)
0 references
1981
0 references
The concave complementarity problem: \(x\geq 0\), \(y=w(x)\geq 0\), \(x^ Ty=0\) \((x\in R^ n\), \(y\in R^ n\), \(w: R^ n\to R^ n\) a concave mapping) is converted into a concave minimization problem under convex constraints and solved by a conical algorithm for concave minimization. A special feature of this concave minimization problem is that its optimal value is equal to zero. This feature is exploited to devise simpler rules for bounding and fathoming than in the general concave minimization problem. The method solves the problem whenever it is solvable.
0 references
concave complementarity problem
0 references
concave minimization
0 references
convex constraints
0 references
conical algorithm
0 references