Can moment-relaxation methods solve polynomial optimization over closed basic semialgebraic sets efficiently, including computing the infimum and the points where it is attained?
Statement
Can moment-relaxation methods solve polynomial optimization over closed basic semialgebraic sets efficiently, including computing the infimum and the points where it is attained?
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.