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!