메뉴 건너뛰기




Volumn 30, Issue 2, 1994, Pages 274-282

Numerical analysis of the orthogonal descent method

(2)  Skokov, V A a   Shchepakin, M B a  

a NONE

Author keywords

[No Author keywords available]

Indexed keywords


EID: 34249772874     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF02366430     Document Type: Article
Times cited : (2)

References (12)
  • 2
    • 84936437221 scopus 로고
    • An orthogonal descent algorithm to find the zero of a convex function, condition of unsolvability, and rate of convergence issues
    • (1992) Kibern. Sist. Anal. , vol.5 , pp. 115-124
    • Shchepakin, M.B.1
  • 4
    • 0027347758 scopus 로고
    • Finding the common point of a system of convex set and solution of optimization problems of mathematical programming by orthogonal descent method
    • (1993) Kibern. Sist. Anal. , vol.1 , pp. 94-101
    • Shchepakin, M.B.1
  • 5
    • 84936415247 scopus 로고    scopus 로고
    • C. Lemarechal, “Numerical experiment in nonsmooth optimization,” in: E. A. Nurminski (ed.), Progress in Nondifferentiable Optimization, Luxenburg, Austria (1982), pp. 61–84.
  • 9
    • 84936420649 scopus 로고    scopus 로고
    • C. Lemarechal, A. Nemirovski, and Yu. Nesterov, New Variants of Bundle Methods, Research Report No. 1508, INRIA (1991).


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.