bound-constrained underdetermined problem

Hi,

I use lsqnonlin to solve an underdetermined problem (thus, Levenberg-Marquardt would be the appropriate algorithm), but I want the solution vector to be within a range of values for each component of the solution vector (so trust-region-reflective would be the algorithm of choice). Any idea how to reconcile the two? thanks