Sciweavers

CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 4 months ago
Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
Roman Vershynin
EVOW
2003
Springer
13 years 9 months ago
Hybrid Evolution Strategy-Downhill Simplex Algorithm for Inverse Light Scattering Problems
The rough surface inverse scattering problem is approached with a combination of evolutionary strategies and the simplex method. The surface, assumed one-dimensional and perfectly ...
Demetrio Macías, Gustavo Olague, Eugenio R....