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
回答(0 个)
类别
在 帮助中心 和 File Exchange 中查找有关 Global or Multiple Starting Point Search 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!