Naum Z. Shor
| Naum Zuselevich Shor | |
|---|---|
| Born |
1 January 1937 Kiev, Ukraine, USSR |
| Died | 26 February 2006 (aged 69) |
| Nationality |
 Soviet Union Ukraine
|
| Institutions | V.M. Glushkov Institute of Cybernetics, Kiev, Ukraine |
Naum Zuselevich Shor (Russian: Наум Зуселевич Шор) (1 January 1937 – 26 February 2006) was a Soviet and Ukrainian Jewish mathematician specializing in optimization.
He made significant contributions to nonlinear and , numerical techniques for non-smooth optimization, discrete optimization problems, matrix optimization, dual quadratic bounds in multi-extremal programming problems.
Shor became a full member of the National Academy of Science of Ukraine in 1998.
N. Z. Shor is well known for his method of generalized gradient descent with space dilation in the direction of the difference of two successive subgradients (the so-called r-algorithm), that was created in collaboration with Nikolay G. Zhurbenko. The ellipsoid method was re-invigorated by A.S. Nemirovsky and D.B. Yudin, who developed a careful complexity analysis of its approximation properties for problems of convex minimization with real data. However, it was Leonid Khachiyan who provided the rational-arithmetic complexity analysis, using an ellipsoid algorithm, that established that linear programming problems can be solved in polynomial time.
...
Wikipedia