The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) (Q1308654): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02073592 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056863167 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) |
scientific article |
Statements
The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) (English)
0 references
10 December 1993
0 references
The authors propose a variable dimension simplicial algorithm for solving a variational inequality problem. The algorithm is based on linear programming pivot operations. A condition of finite termination is given.
0 references
simplicial algorithm
0 references
variable dimension simplicial algorithm
0 references
variational inequality problem
0 references
0 references
0 references
0 references
