메뉴 건너뛰기




Volumn 35, Issue 1, 2006, Pages 85-101

A numerical approach for solving some convex maximization problems

Author keywords

Algorithm; Concave programming; Global maximizer; Global optimization; Simple set

Indexed keywords

CONCAVE PROGRAMMING; CONVEX ANALYSES; GLOBAL MAXIMIZER; SIMPLE SET;

EID: 33646866996     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-005-3271-4     Document Type: Article
Times cited : (7)

References (16)
  • 2
    • 0027662369 scopus 로고
    • A new technique for generating quadratic programming test problems
    • Calamai, P.H., Vincente, L.N. and Júdice, J.J. (1993), A new technique for generating quadratic programming test problems, Mathematical Programming 61, 215-231.
    • (1993) Mathematical Programming , vol.61 , pp. 215-231
    • Calamai, P.H.1    Vincente, L.N.2    Júdice, J.J.3
  • 3
    • 0342986515 scopus 로고    scopus 로고
    • An algorithm for maximizing a convex function over a simple set
    • Enkhbat, R. (1996), An algorithm for maximizing a convex function over a simple set, Journal of Global Optimization 8, 379-391.
    • (1996) Journal of Global Optimization , vol.8 , pp. 379-391
    • Enkhbat, R.1
  • 4
    • 33646878416 scopus 로고    scopus 로고
    • On the maximization and minimization of a quasi-convex function
    • Enkhbat, R. and Ibaraki, T. (2003), On the maximization and minimization of a quasi-convex function, Journal of Nonlinear and Convex Analyses 4(1), 43-76.
    • (2003) Journal of Nonlinear and Convex Analyses , vol.4 , Issue.1 , pp. 43-76
    • Enkhbat, R.1    Ibaraki, T.2
  • 7
    • 0020116651 scopus 로고
    • The gap function of a convex program
    • Hearn, D.W. (1982), The gap function of a convex program, Operations Research Letters 1, 67-71.
    • (1982) Operations Research Letters , vol.1 , pp. 67-71
    • Hearn, D.W.1
  • 10
    • 33646896001 scopus 로고
    • Finding the global maximum of a function of several variables on a set given by inequality constraints
    • Nefedov, V.N. (1987), Finding the global maximum of a function of several variables on a set given by inequality constraints, Journal of Numerical Mathematics and Mathematical Physics 27(1), 35-51.
    • (1987) Journal of Numerical Mathematics and Mathematical Physics , vol.27 , Issue.1 , pp. 35-51
    • Nefedov, V.N.1
  • 12
    • 0000293948 scopus 로고
    • Methods for global concave minimization: A bibliographic survey
    • Pardalos, P.M. and Rosen, J.B. (1986), Methods for global concave minimization: A bibliographic survey, SIAM Review 28, 367-379.
    • (1986) SIAM Review , vol.28 , pp. 367-379
    • Pardalos, P.M.1    Rosen, J.B.2
  • 13
    • 0004267646 scopus 로고    scopus 로고
    • Princeton University Press, Princeton, NJ
    • Rockafellar, Tyrrell R. (1997), Convex Analysis, Princeton University Press, Princeton, NJ.
    • (1997) Convex Analysis
    • Rockafellar, T.R.1
  • 14
    • 0040067911 scopus 로고
    • On the global extremum problem
    • Strekalovsky, A.S. (1987), On the global extremum problem, Soviet Mathematical Doklady 292(5), 1062-1066.
    • (1987) Soviet Mathematical Doklady , vol.292 , Issue.5 , pp. 1062-1066
    • Strekalovsky, A.S.1
  • 15
    • 0006705862 scopus 로고
    • Concave programming under linear constraints
    • Tuy, H. (1964), Concave programming under linear constraints, Soviet Math.Doklady 159(1), 32-35.
    • (1964) Soviet Math.Doklady , vol.159 , Issue.1 , pp. 32-35
    • Tuy, H.1


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