Skip to main content

Solution Is the solution of this optimization problem always positive semidefinite?

deleted 109 characters in body
Source Link
F.G.
  • 73
  • 4

We are given a set of unit vectors $U \subset \mathbb{C}^n$ which spans the space $\mathbb{C}^n$. Given another unit vector $x$, consider then the following optimization problem:

$$ \sup_H \left\{ x^* H x \;:\; H \text{ is Hermitian},\; 0 \leq u^* H u \leq 1 \;\forall u \in U \right\}. $$

This optimization comes up in a problem that I have been solving numerically, and to my surprise, the optimal solution $H$ seems to always be positive semidefinite (when the supremum is actually achieved). I am trying to understand whether this is a general property of the problem.

My question is thus: is the optimal $H$ necessarily positive semidefinite? If not, is there some property of the set $U$ that guarantees that the optimal solution is positive semidefinite?

One observation is that the problem is actually unbounded when the vectors in $U$ are mutually orthogonal. Then one can note that if the supremum is achieved, it must mean that the set $\left\{ uu^* : u \in U \right\}$ spansso we can assume this not to be the space of Hermitian matricescase. However, I do not see if this by itself implies the positive semidefiniteness of the optimal $H$ somehow. I would appreciate any help.

We are given a set of unit vectors $U \subset \mathbb{C}^n$ which spans the space $\mathbb{C}^n$. Given another unit vector $x$, consider then the following optimization problem:

$$ \sup_H \left\{ x^* H x \;:\; H \text{ is Hermitian},\; 0 \leq u^* H u \leq 1 \;\forall u \in U \right\}. $$

This optimization comes up in a problem that I have been solving numerically, and to my surprise, the optimal solution $H$ seems to always be positive semidefinite (when the supremum is actually achieved). I am trying to understand whether this is a general property of the problem.

My question is thus: is the optimal $H$ necessarily positive semidefinite? If not, is there some property of the set $U$ that guarantees that the optimal solution is positive semidefinite?

One observation is that the problem is actually unbounded when the vectors in $U$ are mutually orthogonal. Then one can note that if the supremum is achieved, it must mean that the set $\left\{ uu^* : u \in U \right\}$ spans the space of Hermitian matrices. However, I do not see if this by itself implies the positive semidefiniteness of the optimal $H$ somehow. I would appreciate any help.

We are given a set of unit vectors $U \subset \mathbb{C}^n$ which spans the space $\mathbb{C}^n$. Given another unit vector $x$, consider then the following optimization problem:

$$ \sup_H \left\{ x^* H x \;:\; H \text{ is Hermitian},\; 0 \leq u^* H u \leq 1 \;\forall u \in U \right\}. $$

This optimization comes up in a problem that I have been solving numerically, and to my surprise, the optimal solution $H$ seems to always be positive semidefinite (when the supremum is actually achieved). I am trying to understand whether this is a general property of the problem.

My question is thus: is the optimal $H$ necessarily positive semidefinite? If not, is there some property of the set $U$ that guarantees that the optimal solution is positive semidefinite?

One observation is that the problem is actually unbounded when the vectors in $U$ are mutually orthogonal, so we can assume this not to be the case. However, I do not see if this by itself implies the positive semidefiniteness of the optimal $H$ somehow. I would appreciate any help.

Expanding on the question
Source Link
F.G.
  • 73
  • 4

We are given a set of unit vectors $U \subset \mathbb{C}^n$ which spans the space $\mathbb{C}^n$. Given another unit vector $x$, consider then the following optimization problem:

$$ \sup_H \left\{ x^* H x \;:\; H \text{ is Hermitian},\; 0 \leq u^* H u \leq 1 \;\forall u \in U \right\}. $$

Note that the problem is unbounded when the vectors in $U$ are mutually orthogonal - for the following, one can assume that $U$ is such that an optimal solution exists. This optimization comes up in a problem that I have been solving numerically, and to my surprise, the optimal solution $H$ seems to always be positive semidefinite (when the supremum is actually achieved). I am trying to understand whether this is a general property of the problem.

My question is thus: is the optimal $H$ necessarily positive semidefinite? If not, is there some property of the set $U$ that guarantees that the optimal solution is positive semidefinite?

One observation is that the problem is actually unbounded when the vectors in $U$ are mutually orthogonal. Then one can note that if the supremum is achieved, it must mean that the set $\left\{ uu^* : u \in U \right\}$ spans the space of Hermitian matrices. However, I do not see if this by itself implies the positive semidefiniteness of the optimal $H$ somehow. I would appreciate any help.

We are given a set of unit vectors $U \subset \mathbb{C}^n$ which spans the space $\mathbb{C}^n$. Given another unit vector $x$, consider then the following optimization problem:

$$ \sup_H \left\{ x^* H x \;:\; H \text{ is Hermitian},\; 0 \leq u^* H u \leq 1 \;\forall u \in U \right\}. $$

Note that the problem is unbounded when the vectors in $U$ are mutually orthogonal - for the following, one can assume that $U$ is such that an optimal solution exists. This optimization comes up in a problem that I have been solving numerically, and to my surprise, the optimal solution $H$ seems to always be positive semidefinite. I am trying to understand whether this is a general property of the problem.

My question is thus: is the optimal $H$ necessarily positive semidefinite? If not, is there some property of the set $U$ that guarantees that the optimal solution is positive semidefinite?

We are given a set of unit vectors $U \subset \mathbb{C}^n$ which spans the space $\mathbb{C}^n$. Given another unit vector $x$, consider then the following optimization problem:

$$ \sup_H \left\{ x^* H x \;:\; H \text{ is Hermitian},\; 0 \leq u^* H u \leq 1 \;\forall u \in U \right\}. $$

This optimization comes up in a problem that I have been solving numerically, and to my surprise, the optimal solution $H$ seems to always be positive semidefinite (when the supremum is actually achieved). I am trying to understand whether this is a general property of the problem.

My question is thus: is the optimal $H$ necessarily positive semidefinite? If not, is there some property of the set $U$ that guarantees that the optimal solution is positive semidefinite?

One observation is that the problem is actually unbounded when the vectors in $U$ are mutually orthogonal. Then one can note that if the supremum is achieved, it must mean that the set $\left\{ uu^* : u \in U \right\}$ spans the space of Hermitian matrices. However, I do not see if this by itself implies the positive semidefiniteness of the optimal $H$ somehow. I would appreciate any help.

correction
Source Link
F.G.
  • 73
  • 4
Loading
clarifying
Source Link
F.G.
  • 73
  • 4
Loading
Source Link
F.G.
  • 73
  • 4
Loading