Positive-cone and optimality conjecture for the general first Physarum ansatz
Statement
Let be the trajectory of the general first ansatz for the semidefinite program, and write when is positive definite. Let be a feasible solution of the SDP. General first-ansatz conjecture. If for some feasible solution , then the first ansatz stays in the positive definite cone and converges to the optimum of the SDP. The preceding theorem establishes positive-cone preservation under the additional assumption that is linearly feasible; this conjecture asserts the stated behavior without that assumption.
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.