Handling bound constraints by the Levenberg-Marquardt algorithm
26 ビュー (過去 30 日間)
古いコメントを表示
Hello,
Could anyone please tell me why the Levenberg-Marquardt algorithm embedded in "lsqnonlin" does not handle bound constraints, while the other one ("trust-region-reflective") does?
There are implementations of the Levenberg-Marquardt algorithm that do accept bound constraints, so what is the principle limitation explaining why this has not been implemented in "lsqnonlin"?
Thank you!
Igor.
0 件のコメント
採用された回答
Matt J
2019 年 1 月 29 日
編集済み: Matt J
2019 年 1 月 29 日
The theory of Levenberg-Marquardt does not define a way to handle bound constraints. If, as you claim, there are modifications of classical LM that support bounds, I surmise that they involve manipulations similar in spirit to what is done in the trust-region algorithm.
3 件のコメント
Matt J
2019 年 1 月 29 日
Trust region methods are a very large family, but I don't know of a widely accepted term for Matlab's specific implementation. Maybe you should just cite Coleman and Li.
その他の回答 (1 件)
Xingwang Yong
2021 年 4 月 27 日
編集済み: Xingwang Yong
2021 年 4 月 27 日
In matlab2020b, the doc of lsqcurvefit() has removed "The Levenberg-Marquardt algorithm does not handle bound constraints". So it support bound constraints in LM, can be seen in release notes and doc.
0 件のコメント
参考
カテゴリ
Help Center および File Exchange で Get Started with Optimization Toolbox についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!