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

1 visualización (últimos 30 días)
Chihang Wei
Chihang Wei el 9 de Dic. de 2016
Respondida: Alan Weiss el 12 de Dic. de 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?

Iniciar sesión para responder a esta pregunta.

Respuestas (1)

Alan Weiss
Alan Weiss el 12 de Dic. de 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

Categorías

Más información sobre Quadratic Programming and Cone Programming en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

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

Start Hunting!

Translated by