메뉴 건너뛰기




Volumn 51, Issue 2, 2012, Pages 481-507

On the local convergence of a derivative-free algorithm for least-squares minimization

Author keywords

Asymptotic convergence; Derivative free optimization; Least squares; Levenberg Marquardt method; Local convergence; System of nonlinear equations; Trust region

Indexed keywords

ASYMPTOTIC CONVERGENCE; DERIVATIVE-FREE OPTIMIZATION; LEAST SQUARE; LEVENBERG-MARQUARDT METHOD; LOCAL CONVERGENCE; SYSTEM OF NONLINEAR EQUATIONS; TRUST REGION;

EID: 84862022483     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-010-9367-x     Document Type: Article
Times cited : (34)

References (21)
  • 2
    • 70450200040 scopus 로고    scopus 로고
    • Global convergence of general derivative-free trust-region algorithms to first and second order critical points
    • Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivative-free trust-region algorithms to first and second order critical points. SIAM J. Optim. 20, 387-415 (2009)
    • (2009) SIAM J. Optim. , vol.20 , pp. 387-415
    • Conn, A.R.1    Scheinberg, K.2    Vicente, L.N.3
  • 3
    • 34347204540 scopus 로고    scopus 로고
    • Geometry of interpolation sets in derivative free optimization
    • DOI 10.1007/s10107-006-0073-5
    • Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of interpolation sets in derivative free optimization. Math. Program. 111, 141-172 (2008) (Pubitemid 46993958)
    • (2008) Mathematical Programming , vol.111 , Issue.1-2 , pp. 141-172
    • Conn, A.R.1    Scheinberg, K.2    Vicente, L.N.3
  • 5
    • 55849149812 scopus 로고    scopus 로고
    • Geometry of sample sets in derivative free optimization: Polynomial regression and underdetermined interpolation
    • Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of sample sets in derivative free optimization: Polynomial regression and underdetermined interpolation. IMA J. Numer. Anal. 28, 721-748 (2008)
    • (2008) IMA J. Numer. Anal. , vol.28 , pp. 721-748
    • Conn, A.R.1    Scheinberg, K.2    Vicente, L.N.3
  • 6
    • 0036703345 scopus 로고    scopus 로고
    • Convergence properties of the inexact Levenberg-Marquardt method under local error bound conditions
    • DOI 10.1080/1055678021000049345
    • Dan, H., Yamashita, N., Fukushima, M.: Convergence properties of the inexact Levenberg-Marquardt method under local error bound. Optim. Methods Softw. 17, 605-626 (2002) (Pubitemid 35350765)
    • (2002) Optimization Methods and Software , vol.17 , Issue.4 , pp. 605-626
    • Dan, H.1    Yamashita, N.2    Fukushima, M.3
  • 7
    • 33646596539 scopus 로고    scopus 로고
    • Convergence properties of a self-adaptive levenberg-marquardt algorithm under local error bound condition
    • DOI 10.1007/s10589-005-3074-z
    • Fan, J.: Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition. Comput. Optim. Appl. 34, 47-62 (2006) (Pubitemid 43723963)
    • (2006) Computational Optimization and Applications , vol.34 , Issue.1 , pp. 47-62
    • Fan, J.1    Pan, J.2
  • 8
    • 13744251115 scopus 로고    scopus 로고
    • On the quadratic convergence of the levenberg-marquardt method without nonsingularity assumption
    • DOI 10.1007/s00607-004-0083-1
    • Fan, J., Yuan, Y.: On the quadratic convergence of the Levenberg-Marquardt method without nonsin-gularity assumption. Computing 74, 23-39 (2005) (Pubitemid 40238398)
    • (2005) Computing (Vienna/New York) , vol.74 , Issue.1 , pp. 23-39
    • Fan, J.-Y.1    Yuan, Y.-X.2
  • 9
    • 38949178770 scopus 로고    scopus 로고
    • Self-adaptive inexact proximal point methods
    • DOI 10.1007/s10589-007-9067-3
    • Hager, W.W., Zhang, H.: Self-adaptive inexact proximal point methods. Comput. Optim. Appl. 39, 161-181 (2008) (Pubitemid 351214604)
    • (2008) Computational Optimization and Applications , vol.39 , Issue.2 , pp. 161-181
    • Hager, W.W.1    Zhang, H.2
  • 10
    • 52649108109 scopus 로고    scopus 로고
    • Asymptotic convergence analysis of a new class of proximal point methods
    • Hager, W.W., Zhang, H.: Asymptotic convergence analysis of a new class of proximal point methods. SIAM J. Control Optim. 46, 1683-1704 (2007)
    • (2007) SIAM J. Control Optim. , vol.46 , pp. 1683-1704
    • Hager, W.W.1    Zhang, H.2
  • 12
    • 0001362410 scopus 로고
    • The levenberg-marquardt algorithm, implementation and theory
    • Watson, G.A. (ed.) Springer, Berlin
    • Moré, J.J.: The Levenberg-Marquardt algorithm, implementation and theory. In: Watson, G.A. (ed.) Numerical Analysis. Lecture Notes in Mathematics, vol. 630. Springer, Berlin (1977)
    • (1977) Numerical Analysis. Lecture Notes in Mathematics , vol.630
    • Moré, J.J.1
  • 13
    • 55849131864 scopus 로고    scopus 로고
    • Developments of NEWUOA for unconstrained minimization without derivatives
    • Powell, M.J.D.: Developments of NEWUOA for unconstrained minimization without derivatives. IMA J. Numer. Anal. 28, 649-664 (2008)
    • (2008) IMA J. Numer. Anal. , vol.28 , pp. 649-664
    • Powell, M.J.D.1
  • 14
    • 33748560897 scopus 로고    scopus 로고
    • The NEWUOA software for unconstrained optimization without derivatives
    • Powell, M.J.D.: The NEWUOA software for unconstrained optimization without derivatives. DAMTP (2004)
    • (2004) DAMTP
    • Powell, M.J.D.1
  • 15
    • 21044444302 scopus 로고    scopus 로고
    • Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
    • DOI 10.1007/s10107-003-0490-7
    • Powell, M.J.D.: Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. Math. Program., Ser. B 100, 183-215 (2004) (Pubitemid 40871709)
    • (2004) Mathematical Programming , vol.100 , Issue.1 , pp. 183-215
    • Powell, M.J.D.1
  • 16
    • 3042652542 scopus 로고    scopus 로고
    • On trust region methods for unconstrained minimization without derivatives
    • DOI 10.1007/s10107-003-0430-6
    • Powell, M.J.D.: On trust region methods for unconstrained minimization without derivatives. Math. Program. 97, 605-623 (2003) (Pubitemid 44769762)
    • (2003) Mathematical Programming, Series B , vol.97 , Issue.3 , pp. 605-623
    • Powell, M.J.D.1
  • 17
    • 0002621771 scopus 로고    scopus 로고
    • Error bounds and superlinear convergence analysis of some newton-type methods in optimization
    • Di Pillo, G., Giannessi, F. (eds.) Kluwer Academic, Dordrecht
    • Tseng, P.: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Di Pillo, G., Giannessi, F. (eds.) Nonlinear Optimization and Related Topics, pp. 445-462. Kluwer Academic, Dordrecht (2000)
    • (2000) Nonlinear Optimization and Related Topics , pp. 445-462
    • Tseng, P.1
  • 18
    • 0034353734 scopus 로고    scopus 로고
    • The roximal point algorithm with genuine superlinear convergence for the monotone complementarity problem
    • DOI 10.1137/S105262349935949X
    • Yamashita, N., Fukushima, M.: The proximal point algorithm with genuine superlinear convergence for the monotone complementarity problem. SIAM J. Optim. 11, 364-379 (2000) (Pubitemid 33357977)
    • (2000) SIAM Journal on Optimization , vol.11 , Issue.2 , pp. 364-379
    • Yamashita, N.1    Fukushima, M.2
  • 19
    • 0011662308 scopus 로고    scopus 로고
    • On the rate of convergence of the levenberg-marquardt method
    • Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. Computing 15, 237-249 (2001)
    • (2001) Computing , vol.15 , pp. 237-249
    • Yamashita, N.1    Fukushima, M.2
  • 20
    • 79251526204 scopus 로고    scopus 로고
    • A derivative-free algorithm for least-squares minimization
    • accepted
    • Zhang, H., Conn, A.R., Scheinberg, K.: A derivative-free algorithm for least-squares minimization. SIAM J. Optim. (2010, accepted)
    • (2010) SIAM J. Optim.
    • Zhang, H.1    Conn, A.R.2    Scheinberg, K.3


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