Pure adaptive search in Monte Carlo optimization (Q1119467)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pure adaptive search in Monte Carlo optimization |
scientific article; zbMATH DE number 4099030
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pure adaptive search in Monte Carlo optimization |
scientific article; zbMATH DE number 4099030 |
Statements
Pure adaptive search in Monte Carlo optimization (English)
0 references
1989
0 references
A feasible direction method for linear programming is discussed. This method is similar to Wolfe's reduced gradient method for nonlinear programming. However, some improvements for finite termination are obtained. The complexity of the algorithm is unknown. Some computational experiments are presented.
0 references
interior move
0 references
feasible direction method
0 references
Wolfe's reduced gradient method
0 references
0 references
