메뉴 건너뛰기




Volumn 17, Issue 5, 2002, Pages 783-804

Minmaxmin problems revisited

Author keywords

Exchange algorithm; Minimax; Minmaxmin problems; Optimality conditions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; OPTIMIZATION; SET THEORY;

EID: 18744379741     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678021000060810     Document Type: Article
Times cited : (12)

References (26)
  • 2
    • 0012041512 scopus 로고
    • Quadratic rate of convergence of a linearization method for solving discrete minmax problems
    • V.A. Daugavet and V.N. Malozemov (1981). Quadratic rate of convergence of a linearization method for solving discrete minmax problems. U.S.S.R. Comput. Maths. Math. Phys., 21(4), 19-28.
    • (1981) U.S.S.R. Comput. Maths. Math. Phys. , vol.21 , Issue.4 , pp. 19-28
    • Daugavet, V.A.1    Malozemov, V.N.2
  • 3
    • 0012075612 scopus 로고
    • On a linearization method for numerical solution of the Chebyshev approximation problem
    • V.A. Daugavet and V.N. Malozemov (1982). On a linearization method for numerical solution of the Chebyshev approximation problem. Vestn. Leningr. Univ., Math., 14, 171-177.
    • (1982) Vestn. Leningr. Univ., Math. , vol.14 , pp. 171-177
    • Daugavet, V.A.1    Malozemov, V.N.2
  • 4
    • 0038001232 scopus 로고    scopus 로고
    • Vestnik of St. Petersburg University, Series 1
    • A.V. Demyanov (2002). On solving minmaxmin problems. Vestnik of St. Petersburg University, Series 1, Issue 3 (No. 17), 3-9.
    • (2002) On solving minmaxmin problems , Issue.3-17 , pp. 3-9
    • Demyanov, A.V.1
  • 5
    • 0037298725 scopus 로고    scopus 로고
    • A discrete Chebyshev approximation problem by means of several polynomials
    • Forthcoming
    • A.V. Demyanov. A discrete Chebyshev approximation problem by means of several polynomials. Optimization, Forthcoming.
    • Optimization
    • Demyanov, A.V.1
  • 6
    • 49849118750 scopus 로고
    • On the solution of minimaximin problems
    • V.F. Demyanov (1970). On the solution of minimaximin problems. U.S.S.R. Comput. Maths. Math. Phys., 10(3), 587-596.
    • (1970) U.S.S.R. Comput. Maths. Math. Phys. , vol.10 , Issue.3 , pp. 587-596
    • Demyanov, V.F.1
  • 8
    • 0004122547 scopus 로고
    • Nauka, Moscow. English translations: John Wiley and Sons, New York, Toronto, 1974; Dover Publications, New York
    • V.F. Demyanov and V.N. Malozemov (1972). Introduction to Minimax. Nauka, Moscow. English translations: John Wiley and Sons, New York, Toronto, 1974; Dover Publications, New York, 1990.
    • (1972) Introduction to Minimax
    • Demyanov, V.F.1    Malozemov, V.N.2
  • 9
    • 0002026172 scopus 로고
    • On quasidifferentiable functionals
    • V.F. Demyanov and A.M. Rubinov (1980). On quasidifferentiable functionals. Dokl. Acad. Nauk SSSR, 250(1), 21-25.
    • (1980) Dokl. Acad. Nauk SSSR , vol.250 , Issue.1 , pp. 21-25
    • Demyanov, V.F.1    Rubinov, A.M.2
  • 14
    • 0012073365 scopus 로고
    • Descent methods for quasidifferentiable minimization
    • K.C. Kiwiel (1988). Descent methods for quasidifferentiable minimization. Applied Math. and Optimization, 18(2), 163-180.
    • (1988) Applied Math. and Optimization , vol.18 , Issue.2 , pp. 163-180
    • Kiwiel, K.C.1
  • 15
    • 0012075613 scopus 로고
    • On an extremum problem
    • In Russian
    • V.N. Malozemov (1970). On an extremum problem. Kibernetika, Kiev, 4, 111-114. (In Russian).
    • (1970) Kibernetika, Kiev , vol.4 , pp. 111-114
    • Malozemov, V.N.1
  • 16
    • 0012042285 scopus 로고
    • A minimaximin problem with a degenerate objective function
    • Novosibirsk (In Russian)
    • V.N. Malozemov (1973). A minimaximin problem with a degenerate objective function. Optimizacija, Novosibirsk, 10(27), 47-53. (In Russian).
    • (1973) Optimizacija , vol.10 , Issue.27 , pp. 47-53
    • Malozemov, V.N.1
  • 19
    • 0000012763 scopus 로고
    • Semi-smooth and semi-convex functions in constrained optimization
    • R. Mifflin (1977). Semi-smooth and semi-convex functions in constrained optimization. SIAM Control and Optimization, 15(6), 959-972.
    • (1977) SIAM Control and Optimization , vol.15 , Issue.6 , pp. 959-972
    • Mifflin, R.1
  • 24
    • 0037990793 scopus 로고    scopus 로고
    • Nonconvex optimization and its applications
    • Kluwer Academic Publishers, Dordrecht-Boston-London
    • V. Demyanov and A. Rubinov (Eds.) (2000). Nonconvex optimization and its applications. In: Quasidifferentiability and Related Topics, Vol. 43. Kluwer Academic Publishers, Dordrecht-Boston-London.
    • (2000) Quasidifferentiability and Related Topics , vol.43
    • Demyanov, V.1    Rubinov, A.2
  • 25
    • 0004267646 scopus 로고
    • Princeton University Press, Princeton, N.J.
    • R.T. Rockafellar (1970). Convex Analysis. Princeton University Press, Princeton, N.J.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 26
    • 0000264293 scopus 로고
    • The best piecewise polynomial approximation
    • (1976). Engl. Translation. Sib. Math. J., 16(1975), 706-717
    • A.M. Vershik, V.N. Malozemov and A.B. Pevnyi (1975). The best piecewise polynomial approximation. Sibirskii Math. Zhurnal, 16(5), 925-938; (1976). Engl. Translation. Sib. Math. J., 16(1975), 706-717.
    • (1975) Sibirskii Math. Zhurnal , vol.16 , Issue.5 , pp. 925-938
    • Vershik, A.M.1    Malozemov, V.N.2    Pevnyi, A.B.3


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