Skip to main content
MathOverflow

Return to Question

using full-size parens makes for easier reading of expression.
Source Link
edit approved Jan 26, 2016 at 17:55
Mark Fischler
edit approved Jan 26, 2016 at 17:55
Mark Fischler
  • 1.2k
  • 6
  • 13

Suppose x is a vector of size N with positive real elements sorted in decreasing order. Is it possible to find the analytical solution (no iterative solution) to the optimum value of M (1<= M <= N) wheatherwhether $$M log (1+\frac{M}{\sum_{i=1}^M \frac{1}{x_i}})$$$$M \log \left(1+\frac{M}{\sum_{i=1}^M \frac{1}{x_i}}\right)$$ is maximized?

Suppose x is a vector of size N with positive real elements sorted in decreasing order. Is it possible to find the analytical solution (no iterative solution) to the optimum value of M (1<= M <= N) wheather $$M log (1+\frac{M}{\sum_{i=1}^M \frac{1}{x_i}})$$ is maximized?

Suppose x is a vector of size N with positive real elements sorted in decreasing order. Is it possible to find the analytical solution (no iterative solution) to the optimum value of M (1<= M <= N) whether $$M \log \left(1+\frac{M}{\sum_{i=1}^M \frac{1}{x_i}}\right)$$ is maximized?

Source Link
Jeevan Shrestha
Jeevan Shrestha
  • 11
  • 1

maximization of harmonic mean

Suppose x is a vector of size N with positive real elements sorted in decreasing order. Is it possible to find the analytical solution (no iterative solution) to the optimum value of M (1<= M <= N) wheather $$M log (1+\frac{M}{\sum_{i=1}^M \frac{1}{x_i}})$$ is maximized?