Lines Matching refs:inexact

148 and an inexact step variant of the Levenberg-Marquardt algorithm
189 problem is solved approximately. These algorithms are known as inexact
192 An inexact Newton method requires two ingredients. First, a cheap
200    :label: inexact
205 inexact Newton step based on :eq:`inexact` converges for any
209 Ceres supports both exact and inexact step solution strategies. When
212 iterative linear solver, the inexact step Levenberg-Marquardt
613 automatically switches from the exact step algorithm to an inexact
628 algorithm to an inexact step algorithm.
631 prohibitive for large problems. Indeed, for an inexact Newton solver
1692    For the inexact step Levenberg-Marquardt algorithm, this is the