Is there a term describing a specialised solver which is used as a subroutine or a different, larger solver?
For example, a gradient descent solver which, at each step, uses a line search to optimise what step size to take. I'm after a term to describe that line search algorithm in the context of it being a subroutine of some other, larger algorithm.
The best I could come up with so far is either a 'subsolver' (but I think that means something else already?) or 'hyposolver' (as a contrast to a solver used for hyperparameter optimisation). Both of these are, however, just terms I came up with rather than part of a more established nomenclature.