메뉴 건너뛰기




Volumn 28, Issue 1, 2010, Pages 72-86

A new trust-region algorithm for nonlinear constrained optimization

Author keywords

Active set; Augmented Lagrange function; Filter method; Trust region method

Indexed keywords


EID: 77649320747     PISSN: 02549409     EISSN: None     Source Type: Journal    
DOI: 10.4208/jcm.2009.09-m2924     Document Type: Article
Times cited : (20)

References (29)
  • 1
    • 0023430609 scopus 로고
    • A trust region algorithm for nonlinearly constrained optimization
    • R.H. Byrd, R.B. Schnabel and G.A. Shultz, A trust region algorithm for nonlinearly constrained optimization, SIAM J. Numer. Anal, 24 (1987), 1152-1170.
    • (1987) SIAM J. Numer. Anal , vol.24 , pp. 1152-1170
    • Byrd, R.H.1    Schnabel, R.B.2    Shultz, G.A.3
  • 2
    • 0002336672 scopus 로고
    • A trust region algorithm for nonlinear equality constrained optimization
    • P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds., SIAM, Philadelphia, USA
    • M.R. Celis, J.E. Dennis and R.A. Tapia, A trust region algorithm for nonlinear equality constrained optimization, in: P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds., Numerical Optimization, SIAM, Philadelphia, USA, 1985.
    • (1985) Numerical Optimization
    • Celis, M.R.1    Dennis, J.E.2    Tapia, R.A.3
  • 3
    • 33646754440 scopus 로고    scopus 로고
    • 2-penalty methods for nonlinear programming with strong global convergence properties
    • 2-penalty methods for nonlinear programming with strong global convergence properties, Math. Program., 108 (2006), 1-36.
    • (2006) Math. Program. , vol.108 , pp. 1-36
    • Chen, L.1    Goldfarb, D.2
  • 4
    • 0030303844 scopus 로고    scopus 로고
    • An interior trust region approach for nonlinear minimization subject to bounds
    • T.F. Coleman and Y. Li, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optimiz., 6 (1996), 418-445.
    • (1996) SIAM J. Optimiz. , vol.6 , pp. 418-445
    • Coleman, T.F.1    Li, Y.2
  • 5
    • 0000317378 scopus 로고    scopus 로고
    • A primal-dual trust region algorithm for non-convex nonlinear programming
    • A.R. Conn, N.I.M. Gould, D. Orban and Ph.L. Toint, A primal-dual trust region algorithm for non-convex nonlinear programming, Math. Program., 87 (2000), 215-249.
    • (2000) Math. Program. , vol.87 , pp. 215-249
    • Conn, A.R.1    Gould, N.I.M.2    Orban, D.3    Toint, Ph.L.4
  • 6
    • 0003709683 scopus 로고
    • LANCELOT: a Fortran package for large-scale nonlinear optimization (Release A)
    • Springer, Heidelberg, New York. USA
    • A.R. Conn, N.I.M. Gould and Ph.L. Toint, LANCELOT: a Fortran package for large-scale nonlinear optimization (Release A), Springer, Heidelberg, New York. USA, 1992.
    • (1992)
    • Conn, A.R.1    Gould, N.I.M.2    Toint, Ph.L.3
  • 8
    • 0018505838 scopus 로고
    • Two new unconstrained optimizaiton algorithms which use function and gradient values
    • J.E. Dennis and H.H.W. Mei, Two new unconstrained optimizaiton algorithms which use function and gradient values, J. Optimiz. Theory App., 28 (1979), 453-482.
    • (1979) J. Optimiz. Theory App. , vol.28 , pp. 453-482
    • Dennis, J.E.1    Mei, H.H.W.2
  • 9
    • 28244496090 scopus 로고    scopus 로고
    • Benchmarking optimization software with performance profiles
    • E.D. Dolan and J.J. More, Benchmarking optimization software with performance profiles. Math. Program., Serial A., 91 (2002), 201-213.
    • (2002) Math. Program., Serial A. , vol.91 , pp. 201-213
    • Dolan, E.D.1    More, J.J.2
  • 10
    • 0001963239 scopus 로고
    • A model algorithm for composite NDO problem
    • R. Fletcher, A model algorithm for composite NDO problem, Math. Program. Study, 17 (1982), 67-76.
    • (1982) Math. Program. Study , vol.17 , pp. 67-76
    • Fletcher, R.1
  • 12
    • 0001556338 scopus 로고    scopus 로고
    • Nonlinear programming without a penalty function
    • R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Math. Program., 91 (2002), 239-269.
    • (2002) Math. Program. , vol.91 , pp. 239-269
    • Fletcher, R.1    Leyffer, S.2
  • 13
    • 0000955796 scopus 로고
    • Computing optimizal local constrained step
    • D. Gay, Computing optimizal local constrained step, SIAM J. Sci. Stat. Comp., 2 (1981), 186-197.
    • (1981) SIAM J. Sci. Stat. Comp. , vol.2 , pp. 186-197
    • Gay, D.1
  • 14
    • 0013110127 scopus 로고    scopus 로고
    • CUTEr (and Sif Dec), a constrained and unconstrained testing environment, revisited
    • Technical Report TR/PA/01/04, CERFACS, Toulouse, France
    • N.I.M, Gould, D. Orban and Ph.L. Toint, CUTEr (and Sif Dec), a constrained and unconstrained testing environment, revisited, Technical Report TR/PA/01/04, CERFACS, Toulouse, France, 2001.
    • (2001)
    • Gould, N.I.M.1    Orban, D.2    Toint, Ph.L.3
  • 15
    • 0001678475 scopus 로고
    • Quadratically constrained least squares and quadratic problems
    • G.H. Golub and U. Von Matt, Quadratically constrained least squares and quadratic problems, Numer. Math., 59 (1991), 561-580.
    • (1991) Numer. Math. , vol.59 , pp. 561-580
    • Golub, G.H.1    Von Matt, U.2
  • 18
    • 0003746162 scopus 로고
    • Trust region algorithms for optimization with nonlinear equality and inequality constraints
    • Ph.D. Thesis, University of Colorado at Boulder, USA
    • E.O. Omojokun, Trust Region Algorithms for Optimization with Nonlinear Equality and Inequality Constraints, Ph.D. Thesis, University of Colorado at Boulder, USA, 1989.
    • (1989)
    • Omojokun, E.O.1
  • 19
    • 0002380692 scopus 로고
    • A method for nonlinear constraints in minimization problems
    • in: R. Fletcher, ed., Academic Press, London
    • M.J.D. Powell, A method for nonlinear constraints in minimization problems, in: R. Fletcher, ed., Optimization, Academic Press, London, 1969.
    • (1969) Optimization
    • Powell, M.J.D.1
  • 20
    • 0002340344 scopus 로고
    • A new algorithm for unconstrained optimization
    • in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds., Academic Press, New York
    • M.J.D. Powell, A new algorithm for unconstrained optimization, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds., Nonlinear Programming, Academic Press, New York, 1970, 31-66.
    • (1970) Nonlinear Programming , pp. 31-66
    • Powell, M.J.D.1
  • 21
    • 34249955300 scopus 로고
    • A trust region algorithm for equality constrained optimization
    • M.J.D. Powell and Y.X. Yuan, A trust region algorithm for equality constrained optimization. Math. Program., 49 (1991), 189-213.
    • (1991) Math. Program. , vol.49 , pp. 189-213
    • Powell, M.J.D.1    Yuan, Y.X.2
  • 22
    • 0031141179 scopus 로고    scopus 로고
    • A semidefinite framework for trust region subproblems with applications to large scale minimization
    • F. Rendl and H. Wolkowicz, A semidefinite framework for trust region subproblems with applications to large scale minimization, Math. Program., 77 (1997), 273-299.
    • (1997) Math. Program. , vol.77 , pp. 273-299
    • Rendl, F.1    Wolkowicz, H.2
  • 23
    • 0000305846 scopus 로고
    • The conjugate gradient method and trust regions in large scale optimization
    • T. Steihaug, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal, 20 (1983), 626-637.
    • (1983) SIAM J. Numer. Anal , vol.20 , pp. 626-637
    • Steihaug, T.1
  • 24
    • 0002633896 scopus 로고
    • Towards an efficient sparsity exploiting Newton method for minimization
    • in: I.S. Duff, ed. Academic Press, London
    • Ph.L. Toint, Towards an efficient sparsity exploiting Newton method for minimization, in: I.S. Duff, ed., Sparse Matrices and Their Uses, Academic Press, London, 1981, 57-88.
    • (1981) Sparse Matrices and Their Uses , pp. 57-88
    • Toint, Ph.L.1
  • 25
    • 21044440965 scopus 로고    scopus 로고
    • Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
    • M. Ulbrich and S. Ulbrich, Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function, Math. Program., Serial B., 95 (2003), 103-135.
    • (2003) Math. Program., Serial B. , vol.95 , pp. 103-135
    • Ulbrich, M.1    Ulbrich, S.2
  • 26
    • 0022076594 scopus 로고
    • A trust region algorithm for equality constrained minimization: convergence properties and implementation
    • A. Vardi, A trust region algorithm for equality constrained minimization: convergence properties and implementation, SIAM J. Numer. Anal, 22 (1985), 575-591.
    • (1985) SIAM J. Numer. Anal , vol.22 , pp. 575-591
    • Vardi, A.1
  • 27
    • 21844501023 scopus 로고
    • On the convergence of a new trust algorithm
    • Y.X. Yuan, On the convergence of a new trust algorithm, Numer. Math., 70 (1995), 515-539.
    • (1995) Numer. Math. , vol.70 , pp. 515-539
    • Yuan, Y.X.1
  • 29
    • 0347433923 scopus 로고    scopus 로고
    • On the truncated conjugate gradient method
    • Y.X. Yuan, On the truncated conjugate gradient method, Math. Program., 87 (2000), 561-573.
    • (2000) Math. Program. , vol.87 , pp. 561-573
    • Yuan, Y.X.1


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