A version of the so-called (convex) trust-region problem amounts to finding the minimum of a convex quadratic

Question:

A version of the so-called (convex) trust-region problem amounts to finding the minimum of a convex quadratic function over an Euclidean ball, that is

where  is the given radius of the ball. Prove that the optimal solution to this problem is unique and it is given by

whereor otherwise l is the unique value such that

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Optimization Models

ISBN: 9781107050877

1st Edition

Authors: Giuseppe C. Calafiore, Laurent El Ghaoui

Question Posted: