Skip to main content
deleted 6 characters in body
Source Link
RobPratt
  • 5.4k
  • 1
  • 15
  • 25

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x_i)$$f_i(x)$, where $x_i\in\mathbb{R}^2$$x\in\mathbb{R}^2$, $i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that the local functions $f_i(x_i)$$f_i(x)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_i^*$ and $r^*$, respectively.

Intuitively, I think these optimal solutions should satisfy the following relationship

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x_i)$, where $x_i\in\mathbb{R}^2$, $i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that the local functions $f_i(x_i)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_i^*$ and $r^*$, respectively.

Intuitively, I think these optimal solutions should satisfy the following relationship

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x)$, where $x\in\mathbb{R}^2$, $i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that the local functions $f_i(x)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_i^*$ and $r^*$, respectively.

Intuitively, I think these optimal solutions should satisfy the following relationship

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

added 2 characters in body
Source Link
lzzz
  • 1
  • 1

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x_i)$, where $x_i\in\mathbb{R}^2$, $i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that the local functions $f_i(x_i)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_i^*$ and $r^*$, respectively.

Intuitively, I think thethese optimal solutions should satisfy the following relationship

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x_i)$, where $x_i\in\mathbb{R}^2$, $i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that the local functions $f_i(x_i)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_i^*$ and $r^*$, respectively.

Intuitively, I think the optimal solutions should satisfy the following relationship

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x_i)$, where $x_i\in\mathbb{R}^2$, $i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that the local functions $f_i(x_i)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_i^*$ and $r^*$, respectively.

Intuitively, I think these optimal solutions should satisfy the following relationship

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

added 60 characters in body
Source Link
lzzz
  • 1
  • 1

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x_i)$, where $x_i\in\mathbb{R}^2$, $i\in\left\{1,\ldots,n\right\}$ and $2\leq n<\infty$$i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that they allthe local functions $f_i(x_i)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_1^*,\cdots,x_n^*$$x_i^*$ and $r^*$, respectively.

Intuitively, I think the optimal solutions should satisfy the following relationship

  1. if $x_1^*,\cdots,x_n^*$ is bounded, then $r^*$ is bounded,

  2. or even $r^*$ should be in the convex hull of $x_1^*,\cdots,x_n^*$.

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

This is an unconstrained convex optimization problem. Suppose there are many strongly convex functions $f_i(x_i)$, where $x_i\in\mathbb{R}^2$, $i\in\left\{1,\ldots,n\right\}$ and $2\leq n<\infty$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that they all have unique optimal solutions defined as $x_1^*,\cdots,x_n^*$ and $r^*$, respectively.

Intuitively, I think the optimal solutions should satisfy the following relationship

  1. if $x_1^*,\cdots,x_n^*$ is bounded, then $r^*$ is bounded,

  2. or even $r^*$ should be in the convex hull of $x_1^*,\cdots,x_n^*$.

But I don't know how to prove it. Can someone help me out?

This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x_i)$, where $x_i\in\mathbb{R}^2$, $i\in\mathcal{N}$. The total function is defined as \begin{align} f(r)=\sum_{i=1}^nf_i(r),~~r\in\mathbb{R}^2. \end{align} We know that the local functions $f_i(x_i)$ and total function $f(r)$ have their own unique optimal solutions defined as $x_i^*$ and $r^*$, respectively.

Intuitively, I think the optimal solutions should satisfy the following relationship

1. if $x_i^*$ are all bounded, then $r^*$ is bounded,

2. or even $r^*$ should be in the convex hull of $x_i^*$.

But I don't know how to prove it. Can someone help me out?

added 4 characters in body
Source Link
lzzz
  • 1
  • 1
Loading
added 54 characters in body
Source Link
lzzz
  • 1
  • 1
Loading
added 10 characters in body
Source Link
lzzz
  • 1
  • 1
Loading
added 64 characters in body
Source Link
lzzz
  • 1
  • 1
Loading
added 72 characters in body
Source Link
lzzz
  • 1
  • 1
Loading
Minor Math Jaxing
Source Link
Daniele Tampieri
  • 6.4k
  • 7
  • 30
  • 45
Loading
Source Link
lzzz
  • 1
  • 1
Loading