메뉴 건너뛰기




Volumn 25, Issue 2, 2003, Pages 209-235

On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning

Author keywords

global minimum; non differentiable optimization; optimal set partitioning

Indexed keywords


EID: 84867954346     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/A:1021931422223     Document Type: Article
Times cited : (14)

References (22)
  • 1
    • 84867986751 scopus 로고
    • Poiskovie metodi optimalnogo proektirovania
    • Sovetskoe Radio Moscow (Soviet Radio)
    • Batishev, D.I. (1975), Poiskovie metodi optimalnogo proektirovania (The searching methods of optimal projection), Moscow, Sovetskoe Radio (Soviet Radio) (in Russian).
    • (1975) The Searching Methods of Optimal Projection
    • Batishev, D.I.1
  • 5
    • 84867990468 scopus 로고
    • O primenenii metodov optimalnogo razbienia mnozestv k resheniu zadach globalnoi optimizatii (About the application the optimal set partitioning method to the global optimization problems), Metodi reshenia nelineinih zadach i obrabotki dannih (Methods for solving nonlinear problems and data processing)
    • in Russian
    • Kiseleva, E.M. (1985), O primenenii metodov optimalnogo razbienia mnozestv k resheniu zadach globalnoi optimizatii (About the application the optimal set partitioning method to the global optimization problems), Metodi reshenia nelineinih zadach i obrabotki dannih (Methods for solving nonlinear problems and data processing), DSU:111-116 (in Russian).
    • (1985) DSU , pp. 111-116
    • Kiseleva, E.M.1
  • 6
    • 84867986445 scopus 로고
    • Reshenie odnoi zadachi optimalnogo razbienia s razmesheniem centrov tyazesti podmnozestv
    • (Solution of the one optimal partitioning with allocation gravity centers of these subsets)
    • E.M. Kiseleva 1989 Reshenie odnoi zadachi optimalnogo razbienia s razmesheniem centrov tyazesti podmnozestv J. of Computational Math. and Math. Physics 29 25 709 722 (Solution of the one optimal partitioning with allocation gravity centers of these subsets)
    • (1989) J. of Computational Math. and Math. Physics , vol.29 , Issue.25 , pp. 709-722
    • Kiseleva, E.M.1
  • 7
    • 84867997177 scopus 로고
    • Matematicheskie metodi i algoritmi reshenia neprerivnih zadach optimalnogo razbienia mnozestv i ih prilozenia (Mathematical methods and algorithms for solving the continuous problem and its applications)
    • in Russian
    • Kiseleva, E.M. (1991), Matematicheskie metodi i algoritmi reshenia neprerivnih zadach optimalnogo razbienia mnozestv i ih prilozenia (Mathematical methods and algorithms for solving the continuous problem and its applications), Auto abstract, dissert. doct. of math. & physics sciences, Kiev: 33 (in Russian).
    • (1991) Auto Abstract, Dissert. Doct. of Math. & Physics Sciences, Kiev , pp. 33
    • Kiseleva, E.M.1
  • 8
    • 84868001822 scopus 로고
    • Reshenie neprerivnoi zadachi optimalnogo razbienia v usloviyzh nepolnoi informacii ob ishodnih dannih
    • (Solution the continuous problem of the optimal partitioning in uncertain information about the original data condition)
    • E.M. Kiseleva N.Z. Shor 1991 Reshenie neprerivnoi zadachi optimalnogo razbienia v usloviyzh nepolnoi informacii ob ishodnih dannih J. of Computational Math. and Math. Physics 31 6 799 809 (Solution the continuous problem of the optimal partitioning in uncertain information about the original data condition)
    • (1991) J. of Computational Math. and Math. Physics , vol.31 , Issue.6 , pp. 799-809
    • Kiseleva, E.M.1    Shor, N.Z.2
  • 9
    • 84868004166 scopus 로고
    • Solution of the generalized Neyman-Pearson problem using the methods for the optimal partitioning of sets
    • E.M. Kiseleva 1992 Solution of the generalized Neyman-Pearson problem using the methods for the optimal partitioning of sets J. of Computational Math. and Math. Physics 31 1 167 173
    • (1992) J. of Computational Math. and Math. Physics , vol.31 , Issue.1 , pp. 167-173
    • Kiseleva, E.M.1
  • 10
    • 0141846777 scopus 로고
    • Issledovanie algoritma reshenia odnogo klassa neprerivnih zadach razbienia (Examination the algorithm for solving one class of continuous partitioning problems)
    • (Cybernetics and System Analyses)
    • E.M. Kiseleva N.Z. Shor 1994 Issledovanie algoritma reshenia odnogo klassa neprerivnih zadach razbienia (Examination the algorithm for solving one class of continuous partitioning problems) Kibernetika i sistemniy analiz 1 84 96 (Cybernetics and System Analyses)
    • (1994) Kibernetika i Sistemniy Analiz , vol.1 , pp. 84-96
    • Kiseleva, E.M.1    Shor, N.Z.2
  • 11
    • 84867987369 scopus 로고    scopus 로고
    • Primenenie metoda optimalnogo razbienia mnozestv k resheniu zadach dvumernoi optimizacii (Application the optimal set partitioning method to the problems of two-dimensional global optimization), Matem. Modeli i vichislitelnie metodi v prikladnih zadachah (Math. Models and Computational Methods in Application Problems)
    • in Russian
    • Kiseleva E.M. and Mironenko, A.A. (1996), Primenenie metoda optimalnogo razbienia mnozestv k resheniu zadach dvumernoi optimizacii (Application the optimal set partitioning method to the problems of two-dimensional global optimization), Matem. Modeli i vichislitelnie metodi v prikladnih zadachah (Math. Models and Computational Methods in Application Problems), DSU: 70-73 (in Russian).
    • (1996) DSU , pp. 70-73
    • Kiseleva, E.M.1    Mironenko, A.A.2
  • 13
    • 84867993632 scopus 로고
    • Nauka Moscow (The numerical methods in the multiextremal problems)
    • Strongin, R.G. (1978), Chislennie methodi v mnogoextemalnih zadachah (The numerical methods in the multiextremal problems), Moscow, Nauka (Science) (in Russian).
    • (1978) Chislennie Methodi v Mnogoextemalnih Zadachah
    • Strongin, R.G.1


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