Selection of Proper Optimization Function for Finding Global Minimum

1 次查看(过去 30 天)
I am currently working on the following optimization problem and want to ensure I am getting the global minimum. I am not familiar with optimization functions, so am not sure which algorithm is most appropriate for me. I have access to the Global Optimization Toolbox. The objective function is written as such:
function e2 = IOT_objective(r)
%want to minimize e2
% r --> A row vector with a size of 1 x n
% S --> matrix with a size of n x m
% dm --> A row vector with a size of 1 x m
e=dm-r*S;
e2=e*e';
end

采纳的回答

Matt J
Matt J 2021-4-29
If r is the only unknown, then your objective is convex. Assuming your constraints are also convex, any solution will be a global minimum.
  3 个评论

请先登录,再进行评论。

更多回答(0 个)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by