56 problems
- 0 votes0 replies2 views
Upper-bound conjecture for the Lowest Landau Level Hamiltonian
Upper-bound conjecture. The classical Hamiltonian satisfies the bound
- 0 votes0 replies0 views
Helton–Nie conjecture on convex semialgebraic sets
A convex semialgebraic set is a semialgebraic subset of some finite-dimensional real vector space that is convex, and a spectrahedral shadow is the image of a spectrahedron under a…
- 0 votes0 replies0 views
De Klerk–Laurent conjecture on hypercube sum-of-squares certificates
Let be the hypercube, described by for . For even , let be the degree- truncated quadratic module gener…
- 0 votes0 replies0 views
Extreme-ray conjecture for globally nonnegative forms
Let be the cone of globally nonnegative forms of degree on . Extreme-ray conjecture. Every globally nonnegative form spanning an extreme ra…
- 0 votes0 replies1 view
The biquadratic SOS rank conjecture for 3 by 3 forms
Let a biquadratic form be a homogeneous polynomial of degree two in each of two variable vectors, and let its SOS rank be the smallest number of squares of bilinear forms in a sum-…
- 0 votes0 replies0 views
The minimal mediated sequence cardinality conjecture
For integers and with , let denote the number of elements in a minimal -mediated sequence containing . A sequence of integers…
- 0 votes0 replies0 views
No-gaps conjecture for stubborn degrees
Let be a totally real variety. No-gaps conjecture for stubborn degrees. There exists a positive integer such that for every integer with …
- 0 votes0 replies0 views
Face-relative-interior conjecture for stubborn forms
Let be a totally real variety, let denote its cone of nonnegative forms, and let be a face of . Face-relative-interior conjecture.…
- 0 votes0 replies0 views
Necessary and sufficient global optimality for bivariate quartic regularization
Let and let be any tensor defining the quartic-regularized model . A necessary and sufficient global optimality condition with no relaxation gap should hold for ever…
- 0 votes0 replies0 views
Conjecture that some GPT games separate assemblage and state optima
Let and be state spaces, let be a game, and let and denote the corresponding optimization values over assemblages and bipartite states wi…
- 0 votes0 replies0 views
Conjecture on the cause of conservatism in global rational-stability tests
Consider the globally rationally stable polynomial vector field … and the SOS tests for rational stability applied globally on , with fixed gain bound …
- 0 votes0 replies0 views
Thin-ray characterization of unbounded integer cubic optimization
Thin-ray conjecture. The function is unbounded below on if and only if there exists a ray of such that, for e…
- 0 votes0 replies1 view
Sparse relaxation order conjecture for finite convergence
Let a polynomial optimization problem have a sparse moment relaxation and the corresponding dense moment relaxation, with relaxation order measured by the parameter in the respecti…
- 0 votes0 replies1 view
The H1 heuristic's conjectured preference for challenging optimization problems
The heuristics and are methods for strengthening moment relaxations, with depending more weakly on the quality of available upper bounds t…
- 0 votes0 replies0 views
Concave homogeneous polynomial multilinearization inequality
Concave multilinearization inequality. Then
- 0 votes0 replies0 views
Linear approximation-error conjecture for two-layer polynomial networks
Linear approximation-error conjecture. The bound is
- 0 votes0 replies0 views
Hardness of approximately optimizing low-degree polynomials on the sphere
Let be a low-degree polynomial on the unit sphere. Sphere-optimization hardness conjecture. Approximately optimizing over the unit sphere is conjectured to be computational…
- 0 votes0 replies0 views
Generic finite convergence conjecture for generalized Moment-SOS hierarchies
Generic finite convergence conjecture. There exists a finite set of polynomials in the coefficients of , , , and such that, if
- 0 votes0 replies0 views
Finite convergence conjecture for the Moment-SOS hierarchy with denominators
Finite convergence conjecture. The hierarchy has finite convergence under the optimality condition assumptions.
- 0 votes0 replies0 views
Mordell's inequality conjecture
Mordell's inequality conjecture. The maximum of is for ; equivalently, the complex polynomial optimization problem
- 0 votes0 replies0 views
The sectional-degree formula for the Euclidean distance degree
Let be an irreducible affine variety, and let be its projective closure. Let denote the quadric at infin…
- 0 votes0 replies0 views
Conjecture on extending finite-adaptability tractability to any number of stages
Finite-adaptability tractability conjecture. These theorems can be extended to any .
- 0 votes0 replies0 views
The generalized Lax conjecture for hyperbolic programs
Generalized Lax conjecture. Every hyperbolic program is equivalent to a semidefinite program.
- 0 votes0 replies0 views
The slow-convergence conjecture for polynomial Koopman observables
Slow-convergence conjecture. The convergence of the bounds as increases is slow because, for degree- polynomial , the expression for …
- 0 votes0 replies0 views
First-order Lasserre relaxation exactness conjecture for generic input data
Consider the polynomial optimization problem in equation and its first-order relaxation in the Lasserre hierarchy. First-order relaxation exactness conjecture. Objective value exac…