First-order necessary conditions under constant Jacobian rank for structured low-rank approximation
Statement
Let be a feasible limit point of the sequence generated by the structured low-rank approximation algorithm, and let the Jacobian of the constraint mapping at have constant rank in a neighborhood of . Constant-rank conjecture. The limit point satisfies the first-order necessary conditions for the structured low-rank approximation problem. This conjecture extends the preceding result from the maximal-rank case to situations in which the Jacobian rank is lower but locally constant; the supplied text does not state whether it has been resolved.
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.