15 problems
- 0 votes0 replies0 views
Characterization of spherically quasi-convex quadratic functions on subdual convex sets
Spherical quasi-convexity characterization conjecture. This condition is necessary and sufficient to characterize spherically quasi-convex quadratic functions.
- 0 votes0 replies0 views
Tighter exponential-sum probability inequalities
Let be real values, assumed distinct so that the displayed expression is defined, and consider the probability formula for weighted sums of independent unit-…
- 0 votes0 replies0 views
Nonnegative BH representation conjecture for Eigen-CG inequalities
For any , let denote the corresponding Eigen-CG inequality, and let BH inequalities denote the Boros–Hammer inequalities. Nonnegati…
- 0 votes0 replies0 views
Eigen-CG closure conjecture for BH inequalities
Let denote the family of Eigen-CG inequalities obtained from vectors , and let denote the family of Boros–Hammer inequalit…
- 0 votes0 replies0 views
The conjecture on computational costs when
Computational-cost conjecture. More computational costs are essentially required under the regime .
- 0 votes0 replies0 views
Second-smallest-value conjecture for CDT subproblems and quartically constrained quadratic optimization
A CDT subproblem is a cubic-regularized optimization subproblem, and a nonconvex quadratic optimization problem with a quartic constraint is an optimization problem whose objective…
- 0 votes0 replies0 views
The necessary-and-sufficient condition conjecture for non-strict local minimizers of homogeneous QCQPs
Let … hold; and (ii) there exists a nonzero vector satisfying . This conjecture seeks a complete characterization of non-strict local non-global minimizers; the supplie…
- 0 votes0 replies1 view
Equality of the SOC-RLT bound and the best single-inequality bound for the Celis-Dennis-Tapia problem
Single-inequality bound conjecture. The bound in Burer's approach is equal to the best possible bound that can be obtained by adding a single linear inequality.
- 0 votes0 replies0 views
Strongly polynomial solvability of the integer generalized resource allocation problem
Let Problem be the general quadratic nonseparable resource allocation problem with generalized bound constraints, and consider its integer version, in which for…
- 0 votes0 replies0 views
The weaker positive semidefinite representation conjecture for the two-variable switching hull
Let , , , and let . Let denote the relevant relaxation in the paper, and…
- 0 votes0 replies0 views
The quadratic LPL exponent conjecture
Quadratic LPL exponent conjecture. The exponent equals either or .
- 0 votes0 replies0 views
Conjecture on the number of cuts required for adequate quadratic optimization relaxations
The experiments compare several formulations for quadratic optimization with indicator variables, including formulations with and without cuts, and consider instances whose size is…
- 0 votes0 replies1 view
Conjecture that the degree map is generically one-to-one for nonhypersurface varieties
Let be the variety in the paper's setup, and let be the dimension-preserving morphism from onto…
- 0 votes0 replies1 view
Conic aggregation conjecture for convexifying an intersection of two quadratic inequalities
Let be convex and let be nonconvex. Define … For , set , and suppose that is convex for some with…
- 0 votes0 replies0 views
BNR's conjecture for the nonnegative probability of a Rademacher quadratic form
BNR's conjecture. The estimate