Scaling in optimization problems
조회 수: 4 (최근 30일)
이전 댓글 표시
Assume a simple example, with an optimization problem:max subject to , with and given. I want to solve it with fmincon (because there will be other constraints as well), but with the derivate with dV/dc will get ever smaller with t.
A similar problem occurs when we have:
, where alpha is close to zero.
Is there a way to scale the problem such that the derivates will be of similar size? Otherwise the solution for large t (or smalle alpha) will be less accurate, right?
(One work around would be to use a value function, and solve for each t, but I don't want to do that).
댓글 수: 0
채택된 답변
Matt J
2023년 1월 22일
편집: Matt J
2023년 1월 22일
the derivate with dV/dc will get ever smaller with t.
It's not clear that that matters because the values of c are also influenced by the constraints and their derivatives.
Regardless, though, most fmincon algorithms are Newton-like, which means they already normalize dV/dc by second derivatives.
댓글 수: 0
추가 답변 (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!