trust-region reflective algorithm in lsqnonlin and fmincon: same behavior for "unconstrained" optimization"?
5 views (last 30 days)
Show older comments
Say I provide constraints to lsqnonlin and fmincon. For both, I will choose trust-region-reflective algorithm
Do both fmincon and lsqnonlin behave identical in case the constraints are not active (unconstrained optimization)?
By identical, I mean is the same variant of trust-region-reflective algorithm implemented in fmincon and lsqnonlin, or are they different?
0 Comments
Accepted Answer
Matt J
on 15 Feb 2023
Edited: Matt J
on 15 Feb 2023
4 Comments
Matt J
on 16 Feb 2023
Edited: Matt J
on 16 Feb 2023
Interestingly, the three solutions differ only by a constant.
Because [1;1;1] is in the null space of A.
Would you consider the solution "FMINCON - ONLY GRADIENT" to be the worst of the three solutions?
They all achieve the same resnorm so how could it be worse than any of the others?
Which of the algorithm in fmincon resembles the trust-region-reflective algorithm most closely?
I don't think a comparison can be drawn. Inequality constraints are going to change the algorithm a lot.
More Answers (0)
See Also
Categories
Find more on Get Started with Optimization Toolbox in Help Center and File Exchange
Products
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!