How to find the global minimization of a quadratic concave function (or maximization of a convex function) over quadratic convex constraints ?
2 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaires
Réponses (1)
Alan Weiss
le 12 Déc 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
0 commentaires
Voir également
Catégories
En savoir plus sur Quadratic Programming and Cone Programming dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!