Let (0 leqslant w leqslant 1). Show that the solution to the convex optimization problem [ begin{gather*}
Question:
Let \(0 \leqslant w \leqslant 1\). Show that the solution to the convex optimization problem
\[ \begin{gather*} \min _{p_{1}, \ldots, p_{n}} \sum_{i=1}^{n} p_{i}^{2} \tag{7.28}\\ \text { subject to: } \sum_{i=1}^{n-1} p_{i}=w \text { and } \sum_{i=1}^{n} p_{i}=1 \end{gather*} \]
is given by \(p_{i}=w /(n-1), i=1, \ldots, n-1\) and \(p_{n}=1-w\).
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Data Science And Machine Learning Mathematical And Statistical Methods
ISBN: 9781118710852
1st Edition
Authors: Dirk P. Kroese, Thomas Taimre, Radislav Vaisman, Zdravko Botev
Question Posted: