ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X(t)X(t) be the trajectory of the general first ansatz for the semidefinite program, and write X(0)≻FX(0)\succ F when X(0)−FX(0)-F is positive definite. Let FF be a feasible solution of the SDP. General first-ansatz conjecture. If X(0)≻FX(0)\succ F for some feasible solution FF, 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 C−1C^{-1} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.