R-algorithms and ellipsoids

Cybernetics and Systems Analysis

Volumn 32, Issue 1, 1996, Pages 93-110

  Stetsyuk, P I ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747011252     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF02366587     Document Type: Article

References (12)

1. N. Z. Shor and N. G. ZhurbenkoMinimization method using space dilation in the direction of the difference of two successive gradients, Kibernetika, No. 3, 51-59 (1971).
2. N. Z. Shor, Minimization Methods for Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kiev (1979).
3. P. I. StetsyukOn convergence of /algorithms, Kibern. Sist. Anal., No. 6, 173-177 (1995).
4. N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
5. P. I. StetsyukConvergence proof for space-dilation algorithms, in: Optimal Decision Theory [in Russian], Inst. Kibern. im. V. M. Glushkova NAN Ukr., Kiev (1995), pp. 4-8.
6. B. T. Polyak, An Introduction to Optimization [in Russian], Nauka, Moscow (1983).
7. K. C. KiewelAn aggregate subgradient method for nonsmooth convex programming, Math. Progr., No. 27/3, 320341 (1983).
8. C. Lemarechal and R. Mifflin (eds.), Nonsmooth Optimization, Pergamon Press, Oxford (1978).
9. M. B. ShchepakinOrthogonal descent method, Kibernetika, No. 1, 58-62 (1987).
10. C. LemarechalAn extension of Davidon methods to nondifferentiable problems, Math. Progr. Study 3, NorthHolland, Amsterdam (1975), pp. 95-109.
11. D. B. Yudin and A. S. NemirovskiiInformation complexity and effective methods for convex extremal problems, Ekon. Mat. Met., No. 2, 357-359 (1976).
12. N. Z. ShorCutting plane method with space dilation for the convex programming problem, Kibernetika, No. 1, 94-95 (1977).