How to find the global minimization of a quadratic concave function (or maximization of a convex function) over quadratic convex constraints ?

3 Ansichten (letzte 30 Tage)
Chihang Wei
Chihang Wei am 9 Dez. 2016
Beantwortet: Alan Weiss am 12 Dez. 2016
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?

Melden Sie sich an, um diese Frage zu beantworten.

Antworten (1)

Alan Weiss
Alan Weiss am 12 Dez. 2016
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

Kategorien

Mehr zu Quadratic Programming and Cone Programming finden Sie in Help Center und File Exchange

Tags

Community Treasure Hunt

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

Start Hunting!

Translated by