Pure adaptive search in Monte Carlo optimization
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.
scientific article; zbMATH DE number 4099030
scientific article