메뉴 건너뛰기




Volumn 109, Issue 2-3, 1998, Pages 227-249

MERLIN-3.0: A multidimensional optimization environment

Author keywords

Curve fitting; Modeling; Neural network training; Optimization

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; CURVE FITTING; LEARNING SYSTEMS; NEURAL NETWORKS; OPTIMIZATION;

EID: 0032046774     PISSN: 00104655     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0010-4655(98)00005-8     Document Type: Article
Times cited : (46)

References (42)
  • 1
    • 0032045459 scopus 로고    scopus 로고
    • The MERLIN control language for strategic optimization
    • succeeding article
    • D.G. Papageorgiou, I.N. Demetropoulos, I.E. Lagaris, The Merlin Control Language for strategic optimization, Comput. Phys. Commun. 109 (1998) 250-275, succeeding article.
    • (1998) Comput. Phys. Commun. , vol.109 , pp. 250-275
    • Papageorgiou, D.G.1    Demetropoulos, I.N.2    Lagaris, I.E.3
  • 3
    • 84946640734 scopus 로고
    • Sequential application of simplex designs of optimization and evolutionary operations
    • W. Spendley, G.R. Hext, F.R. Himsworth, Sequential application of simplex designs of optimization and evolutionary operations, Technometrics 4 (1962) 441-461.
    • (1962) Technometrics , vol.4 , pp. 441-461
    • Spendley, W.1    Hext, G.R.2    Himsworth, F.R.3
  • 4
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • J.A. Nelder, R. Mead, A simplex method for function minimization, Comput. J. 7 (1964) 308-313.
    • (1964) Comput. J. , vol.7 , pp. 308-313
    • Nelder, J.A.1    Mead, R.2
  • 5
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • Errata
    • J.A. Nelder, R. Mead, A simplex method for function minimization, Comput. J. (Errata) 8 (1965) 27.
    • (1965) Comput. J. , vol.8 , pp. 27
    • Nelder, J.A.1    Mead, R.2
  • 9
    • 84890148722 scopus 로고
    • Rank one methods for unconstrained optimization
    • J. Abadie, Ed., North-Holland, Amsterdam
    • M.J.D. Powell, Rank one methods for unconstrained optimization, in: Nonlinear and Integer Programming, J. Abadie, ed. (North-Holland, Amsterdam, 1970).
    • (1970) Nonlinear and Integer Programming
    • Powell, M.J.D.1
  • 10
    • 0018505838 scopus 로고
    • Two new unconstrained optimization algorithms which use function and gradient values
    • J.E. Dennis, Jr., H.H. Mei, Two new unconstrained optimization algorithms which use function and gradient values, J. Optim. Theory & Appl. 28 (1979) 453-482.
    • (1979) J. Optim. Theory & Appl. , vol.28 , pp. 453-482
    • Dennis J.E., Jr.1    Mei, H.H.2
  • 11
    • 0003859310 scopus 로고
    • On steepest descent
    • A.A. Goldstein, On steepest descent, SIAM J. Control 3 (1965) 147-151.
    • (1965) Siam J. Control , vol.3 , pp. 147-151
    • Goldstein, A.A.1
  • 12
    • 0014492147 scopus 로고
    • Convergence conditions for ascent methods
    • P. Wolfe, Convergence conditions for ascent methods, SIAM Rev. 11 (1969) 226-235.
    • (1969) Siam Rev. , vol.11 , pp. 226-235
    • Wolfe, P.1
  • 13
    • 0003797421 scopus 로고
    • A view of unconstrained optimization
    • L.C.W. Dixonm, ed. (Academic Press, New York)
    • M.J.D. Powell, A view of unconstrained optimization, in: Optimization in Action, L.C.W. Dixonm, ed. (Academic Press, New York, 1976).
    • (1976) Optimization in Action
    • Powell, M.J.D.1
  • 14
    • 0014825610 scopus 로고
    • A new approach to variable metric algorithms
    • R. Fletcher, A new approach to variable metric algorithms, Comput. J. 13 (1970) 317-322.
    • (1970) Comput. J. , vol.13 , pp. 317-322
    • Fletcher, R.1
  • 15
    • 84966251980 scopus 로고
    • A family of variable metric methods derived by variational means
    • D. Goldfarb, A family of variable metric methods derived by variational means, Math. Comput. 24 (1970) 23-26.
    • (1970) Math. Comput. , vol.24 , pp. 23-26
    • Goldfarb, D.1
  • 16
    • 19944366594 scopus 로고
    • The convergence of a class of double rank minimization algorithms. 2. The new algorithm
    • C.G. Broyden, The convergence of a class of double rank minimization algorithms. 2. The new algorithm, J. Instit. Math. & Appl. 6 (1970) 222-231.
    • (1970) J. Instit. Math. & Appl. , vol.6 , pp. 222-231
    • Broyden, C.G.1
  • 17
    • 84968497764 scopus 로고
    • Conditioning of quasi-Newton methods for function minimizations
    • D.F. Shanno, Conditioning of quasi-Newton methods for function minimizations, Math. Comput. 24 (1970) 641-656.
    • (1970) Math. Comput. , vol.24 , pp. 641-656
    • Shanno, D.F.1
  • 19
    • 0000387235 scopus 로고
    • A rapidly convergent descent method for minimization
    • R. Fletcher, M.J.D. Powell, A rapidly convergent descent method for minimization, Comput. J. 6 (1963) 163-168.
    • (1963) Comput. J. , vol.6 , pp. 163-168
    • Fletcher, R.1    Powell, M.J.D.2
  • 20
    • 0020826623 scopus 로고
    • A numerically stable dual method for solving strictly convex quadratic programs
    • D. Goldfarb, A. Idnani, A numerically stable dual method for solving strictly convex quadratic programs, Math. Program. 27 (1983) 1-33.
    • (1983) Math. Program. , vol.27 , pp. 1-33
    • Goldfarb, D.1    Idnani, A.2
  • 21
    • 0024913091 scopus 로고
    • A tolerant algorithm for linearly constrained optimization calculations
    • M.J.D. Powell, A tolerant algorithm for linearly constrained optimization calculations, Math. Program. 45 (1989) 547.
    • (1989) Math. Program. , vol.45 , pp. 547
    • Powell, M.J.D.1
  • 23
    • 0000615669 scopus 로고
    • Function optimization by conjugate gradients
    • R. Fletcher, C. Reeves, Function optimization by conjugate gradients, Comput. J. 7 (1964) 149-154.
    • (1964) Comput. J. , vol.7 , pp. 149-154
    • Fletcher, R.1    Reeves, C.2
  • 24
    • 0001903222 scopus 로고
    • Note sur la convergence des methodes de directions conjuguees
    • France
    • E. Polak, G. Ribiere, Note Sur la Convergence des Methodes de Directions Conjuguees, Rev. Fr. Inf. & Rech. Oper. (France) 16 (1969) 35-43.
    • (1969) Rev. Fr. Inf. & Rech. Oper. , vol.16 , pp. 35-43
    • Polak, E.1    Ribiere, G.2
  • 26
    • 0000873069 scopus 로고
    • A method for the solution of certain problems in least squares
    • K. Levenberg, A method for the solution of certain problems in least squares, Q. Appl. Math. 2 (1944) 164-168.
    • (1944) Q. Appl. Math. , vol.2 , pp. 164-168
    • Levenberg, K.1
  • 27
    • 0000169232 scopus 로고
    • An algorithm for least squares estimation of nonlinear parameters
    • D.W. Marquardt, An algorithm for least squares estimation of nonlinear parameters, SIAM J. Indust. & Appl. Math. 11 (1963) 431-441.
    • (1963) Siam J. Indust. & Appl. Math. , vol.11 , pp. 431-441
    • Marquardt, D.W.1
  • 28
    • 0001362410 scopus 로고
    • The Levenberg-Marquardt algorithm: Implementation, theory
    • Numerical Analysis, G.A. Watson, ed., Springer, Berlin
    • J.J. Moré, The Levenberg-Marquardt algorithm: implementation, theory, in: Numerical Analysis, G.A. Watson, ed., Lecture Notes in Mathematics, Vol. 630 (Springer, Berlin, 1977) pp. 105-116.
    • (1977) Lecture Notes in Mathematics , vol.630 , pp. 105-116
    • Moré, J.J.1
  • 30
    • 0022675909 scopus 로고
    • An efficient line search for nonlinear least squares
    • M. Al-Baali, R. Fletcher, An efficient line search for nonlinear least squares, J. Optim. Th. & Applic. 48 (1986) 359-378.
    • (1986) J. Optim. Th. & Applic. , vol.48 , pp. 359-378
    • Al-Baali, M.1    Fletcher, R.2
  • 35
    • 0030071517 scopus 로고    scopus 로고
    • How many conformers of the 1,2,3-propanetriol triacetate are present in gas phase and in aqueous solution?
    • D.G. Papageorgiou, I.N. Demetropoulos, I.E. Lagaris, RT. Papadimitriou, How many conformers of the 1,2,3-Propanetriol Triacetate are present in gas phase and in aqueous solution?, Tetrahedron 52 (1996) 677-686.
    • (1996) Tetrahedron , vol.52 , pp. 677-686
    • Papageorgiou, D.G.1    Demetropoulos, I.N.2    Lagaris, I.E.3    Papadimitriou, R.T.4
  • 39
    • 0031653036 scopus 로고    scopus 로고
    • Neural network training, simulation using a multidimensional optimization system
    • to appear
    • A. Likas, D.A. Karras, I.E. Lagaris, Neural network training, simulation using a multidimensional optimization system, Int. J. Comput. Math., to appear.
    • Int. J. Comput. Math.
    • Likas, A.1    Karras, D.A.2    Lagaris, I.E.3
  • 42
    • 0028371842 scopus 로고
    • RANLUX: A fortran implementation of the high-quality pseudo-random number generator of Luscher
    • F. James, RANLUX: A Fortran implementation of the high-quality pseudo-random number generator of Luscher, Comput. Phys. Commun. 79 (1994) 111-114.
    • (1994) Comput. Phys. Commun. , vol.79 , pp. 111-114
    • James, F.1


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