binary quadratic optimization under linear constraints
显示 更早的评论
Hi guys.
I have to find an optimal gradient and intercept of a straight to minimize the sum of squared deviations to fit a 2D data points set, with linear constraints.
So, i have to solve the binary quadratic optimization problem: minF(ki,bi)=min(sum(ki*xj+bi-yj))^2 where (xj,yj) are the coordinates of the j-th data set point.
i have also to define some constraints, such as:
ki<=Kmax;
Hmin <= ki*xj+bi-yj <= Hmax
i've tried to use fmincon and quadprog but i was not able to solve my problem. could someone give me some tips?
many thanks
采纳的回答
更多回答(0 个)
类别
在 帮助中心 和 File Exchange 中查找有关 Quadratic Programming and Cone Programming 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!