bound-constrained underdetermined problem
Show older comments
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
Answers (0)
Categories
Find more on Global or Multiple Starting Point Search in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!