The minimum-eigenvalue conjecture for the two-way Gaussian channel objective
Statement
Let and be the linear encoding matrices, with of the form specified in. Let be the objective-weight parameter, let and be the users' noise variances, and let be the symmetric matrix in the constrained optimization problem
subject to . Write for the smallest eigenvalue of . Minimum-eigenvalue conjecture. For any and of the specified form,
This bound is intended to characterize the objective value of the optimization problem and thereby guide the optimal choice of the message-encoding vector for User 2. The supplied text does not state whether the conjecture has been proved or disproved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.