How to find the global minimization of a quadratic concave function (or maximization of a convex function) over quadratic convex constraints ?
3 ビュー (過去 30 日間)
古いコメントを表示
The optimization problem in standard form is: min -x'Px s.t. x'Qx<=d where P and Q are both positive semidefinite. Then how to find the speicific x to minimize -x'Px?
0 件のコメント
回答 (1 件)
Alan Weiss
2016 年 12 月 12 日
You could try fmincon starting from a variety of points. For an efficient problem formulation, see Linear or Quadratic Objective with a Quadratic Constraint.
Alan Weiss
MATLAB mathematical toolbox documentation
0 件のコメント
参考
カテゴリ
Help Center および 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!