메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1262-1269

An incremental trust-region method for Robust online sparse least-squares estimation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; MAXIMUM LIKELIHOOD ESTIMATION; ROBOTICS;

EID: 84864465450     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2012.6224646     Document Type: Conference Paper
Times cited : (50)

References (20)
  • 1
    • 0026106833 scopus 로고
    • On the global convergence of trust region algorithms using inexact gradient information
    • R.G. Carter. On the global convergence of trust region algorithms using inexact gradient information. SIAM Journal on Numerical Analysis, 28(1):251-265, 1991.
    • (1991) SIAM Journal on Numerical Analysis , vol.28 , Issue.1 , pp. 251-265
    • Carter, R.G.1
  • 3
    • 33750968800 scopus 로고    scopus 로고
    • Square Root SAM: Simultaneous localization and mapping via square root information smoothing
    • Dec
    • F. Dellaert and M. Kaess. Square Root SAM: Simultaneous localization and mapping via square root information smoothing. Intl. J. of Robotics Research, 25(12):1181-1203, Dec 2006.
    • (2006) Intl. J. of Robotics Research , vol.25 , Issue.12 , pp. 1181-1203
    • Dellaert, F.1    Kaess, M.2
  • 5
    • 0004236492 scopus 로고    scopus 로고
    • Johns Hopkins University Press, Baltimore, MD, 3rd edition
    • G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, 3rd edition, 1996.
    • (1996) Matrix Computations
    • Golub, G.1    Van Loan, C.2
  • 7
    • 70350707935 scopus 로고    scopus 로고
    • Covariance recovery from a square root information matrix for data association
    • Dec
    • M. Kaess and F. Dellaert. Covariance recovery from a square root information matrix for data association. Journal of Robotics and Autonomous Systems, 57(12):1198-1210, Dec 2009.
    • (2009) Journal of Robotics and Autonomous Systems , vol.57 , Issue.12 , pp. 1198-1210
    • Kaess, M.1    Dellaert, F.2
  • 10
    • 58249138093 scopus 로고    scopus 로고
    • iSAM: Incremental smoothing and mapping
    • Dec
    • M. Kaess, A. Ranganathan, and F. Dellaert. iSAM: Incremental smoothing and mapping. IEEE Trans. Robotics, 24(6):1365-1378, Dec 2008.
    • (2008) IEEE Trans. Robotics , vol.24 , Issue.6 , pp. 1365-1378
    • Kaess, M.1    Ranganathan, A.2    Dellaert, F.3
  • 13
    • 0000873069 scopus 로고
    • A method for the solution of certain nonlinear problems in least squares
    • K. Levenberg. A method for the solution of certain nonlinear problems in least squares. Quart. Appl. Math, 2(2):164-168, 1944.
    • (1944) Quart. Appl. Math , vol.2 , Issue.2 , pp. 164-168
    • Levenberg, K.1
  • 14
    • 33745925296 scopus 로고    scopus 로고
    • Is Levenberg-Marquardt the most efficient optimization algorithm for implementing bundle adjustment?
    • M.I.A. Lourakis and A.A. Antonis. Is Levenberg-Marquardt the most efficient optimization algorithm for implementing bundle adjustment? Intl. Conf. on Computer Vision (ICCV), 2:1526-1531, 2005.
    • (2005) Intl. Conf. on Computer Vision (ICCV) , vol.2 , pp. 1526-1531
    • Lourakis, M.I.A.1    Antonis, A.A.2
  • 16
    • 0002340344 scopus 로고
    • A new algorithm for unconstrained optimization
    • J. Rosen, O. Mangasarian, and K. Ritter, editors, Academic Press
    • M.J.D. Powell. A new algorithm for unconstrained optimization. In J. Rosen, O. Mangasarian, and K. Ritter, editors, Nonlinear Programming, pages 31-65. Academic Press, 1970.
    • (1970) Nonlinear Programming , pp. 31-65
    • Powell, M.J.D.1
  • 17
    • 0021482384 scopus 로고
    • On the global convergence of trust region algorithms for unconstrained minimization
    • M.J.D. Powell. On the global convergence of trust region algorithms for unconstrained minimization. Mathematical Programming, 29(3):297-303, 1984.
    • (1984) Mathematical Programming , vol.29 , Issue.3 , pp. 297-303
    • Powell, M.J.D.1
  • 18
    • 0022015590 scopus 로고
    • A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties
    • G.A. Shultz, R.B. Schnabel, and R.H. Byrd. A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties. SIAM Journal on Numerical Analysis, 22(1):47-67, 1985.
    • (1985) SIAM Journal on Numerical Analysis , vol.22 , Issue.1 , pp. 47-67
    • Shultz, G.A.1    Schnabel, R.B.2    Byrd, R.H.3


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