An incremental trust-region method for Robust online sparse least-squares estimation
Authors:
Open Access
- 1 May 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (10504729) , 1262-1269
Abstract
Many online inference problems in computer vision and robotics are characterized by probability distributions whose factor graph representations are sparse and whose factors are all Gaussian functions of error residuals. Under these conditions, maximum likelihood estimation corresponds to solving a sequence of sparse least-squares minimization problems in which additional summands are added to the objective function over time. In this paper we present Robust Incremental least-Squares Estimation (RISE), an incrementalized version of the Powell's Dog-Leg trust-region method suitable for use in online sparse least-squares minimization. As a trust-region method, Powell's Dog-Leg enjoys excellent global convergence properties, and is known to be considerably faster than both Gauss-Newton and Levenberg-Marquardt when applied to sparse least-squares problems. Consequently, RISE maintains the speed of current state-of-the-art incremental sparse least-squares methods while providing superior robustness to objective function nonlinearities.Keywords
This publication has 13 references indexed in Scilit:
- Covariance recovery from a square root information matrix for data associationRobotics and Autonomous Systems, 2009
- iSAM: Incremental Smoothing and MappingIEEE Transactions on Robotics, 2008
- Square Root SAM: Simultaneous Localization and Mapping via Square Root Information SmoothingThe International Journal of Robotics Research, 2006
- A column approximate minimum degree ordering algorithmACM Transactions on Mathematical Software, 2004
- Multiple View Geometry in Computer Vision2004
- On the Global Convergence of Trust Region Algorithms Using Inexact Gradient InformationSIAM Journal on Numerical Analysis, 1991
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence PropertiesSIAM Journal on Numerical Analysis, 1985
- On the global convergence of trust region algorithms for unconstrained minimizationMathematical Programming, 1984
- A New Algorithm for Unconstrained Optimization1970
- A method for the solution of certain non-linear problems in least squaresQuarterly of Applied Mathematics, 1944