메뉴 건너뛰기




Volumn 31, Issue 6, 2004, Pages 941-962

Active set strategies in an ellipsoid algorithm for nonlinear programming

Author keywords

Active set strategy; Computational experiments; Ellipsoid algorithm; Equality constraints; Nonlinear optimization; Performance profiles; Restarting strategy

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY;

EID: 1142281184     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00045-5     Document Type: Article
Times cited : (2)

References (24)
  • 1
    • 0002252730 scopus 로고
    • Cut-off method with space extension in convex programming problems
    • Shor N.Z. Cut-off method with space extension in convex programming problems Cybernetics 12 1977 94-96
    • (1977) Cybernetics , vol.12 , pp. 94-96
    • Shor, N.Z.1
  • 8
    • 28244496090 scopus 로고    scopus 로고
    • Benchmarking optimization software with performance profiles
    • Dolan E.D. Moré J.J. Benchmarking optimization software with performance profiles Math. Programming Ser. A 91 2002 201-213
    • (2002) Math. Programming Ser. A , vol.91 , pp. 201-213
    • Dolan, E.D.1    Moré, J.J.2
  • 9
    • 84976749713 scopus 로고
    • On reporting computational experiments with mathematical software
    • Crowder H. Dembo R.S. Mulvey J.M. On reporting computational experiments with mathematical software ACM Trans Math Software 5 1979 193-203
    • (1979) ACM Trans Math Software , vol.5 , pp. 193-203
    • Crowder, H.1    Dembo, R.S.2    Mulvey, J.M.3
  • 11
    • 0040518508 scopus 로고
    • New York Scientific Center Report 320-2949. New York: International Business Machines
    • Colville AR. A comparative study on nonlinear programming codes. New York Scientific Center Report 320-2949. New York: International Business Machines, 1968.
    • (1968) A Comparative Study on Nonlinear Programming Codes
    • Colville, A.R.1
  • 12
    • 0344540555 scopus 로고
    • A set of geometric programming test problems and their solutions
    • Dembo R.S. A set of geometric programming test problems and their solutions Math Programming 10 1976 192-213
    • (1976) Math Programming , vol.10 , pp. 192-213
    • Dembo, R.S.1
  • 17
    • 0000137128 scopus 로고
    • Widely convergent method for finding multiple solutions of simultaneous equations
    • Branin F.H. Widely convergent method for finding multiple solutions of simultaneous equations IBM J Res Dev 16 1972 504-522
    • (1972) IBM J Res Dev , vol.16 , pp. 504-522
    • Branin, F.H.1
  • 20
    • 0028257449 scopus 로고
    • Global minimization by reducing the duality gap
    • Ben-Tal A. Eiger G. Gershovitz V. Global minimization by reducing the duality gap Math Programming 63 1994 193-212
    • (1994) Math Programming , vol.63 , pp. 193-212
    • Ben-Tal, A.1    Eiger, G.2    Gershovitz, V.3
  • 21
    • 0039922713 scopus 로고
    • Methods for minimax optimization
    • Hald J. Madsen K. Methods for minimax optimization Math Programming 20 1981 49-62
    • (1981) Math Programming , vol.20 , pp. 49-62
    • Hald, J.1    Madsen, K.2
  • 22
    • 0016470631 scopus 로고
    • A geometric programming model for optimal allocation of stream dissolved oxygen
    • Ecker J.G. A geometric programming model for optimal allocation of stream dissolved oxygen Manage Sci 21 1975 658-668
    • (1975) Manage Sci , vol.21 , pp. 658-668
    • Ecker, J.G.1
  • 24
    • 0022128303 scopus 로고
    • A computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms
    • Ecker J.G. Kupferschmid M. A computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms SIAM J Control Optim 23 1985 657-674
    • (1985) SIAM J Control Optim , vol.23 , pp. 657-674
    • Ecker, J.G.1    Kupferschmid, M.2


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