42 problems
For , let . For the class of convex functions that are -Lipschitz with respect to…
Let be the explicit family of -dimensional ellipsoids considered in the cited problem, accessed through a membership oracle. Determine the quantum membership-query complex…
Cyclic Douglas–Rachford best approximation conjecture. If a best approximation pair relative to exists, then the two-set cyclic Douglas–Rachford scheme converges weakly…
Let . Consider a method whose iterates have the form … where is the initial point, is a convex function accessed through a gradient oracl…
A homogeneous polynomial is hyperbolic with respect to if and, for every , the polynomial h…
Let , and let be independent random vectors with … For an ellipsoid , say that it is an ellipsoid fit to if every point…
Polynomial lower-bound conjecture. There exists such that
Let , , and be finite-dimensional complex Hilbert spaces, let and…
The paper considers generalized gradient flows and convex optimization on entanglement polytopes in Hadamard manifolds. In particular, the preceding discussion uses unitary matrice…
Tensor robust PCA recovery conjecture. The factor
In the convex composite problem with closed proper convex functions , suppose the Douglas–Rachford operator has a fixed point and is -smooth. Let denot…
Consider the convex composite problem … where and are closed proper convex functions. Assume that the Douglas–Rachford operator has a fixed point , that is …
Let and be operators satisfying the paper's standing Assumption, let be -cocoercive, and let for a closed proper convex function . Let…
Let be the Hilbert space underlying the compact convex set considered, and let denote the optimal runtime complexity of its projection operator, while denot…
Let and define a convex constrained optimization problem of the form … For a penalty parameter , consider the penalty relaxation … where denotes the pos…
Log trace-inverse self-concordance conjecture. The function is -generalized self-concordant for some and on some subset of the positive-definite…
Spectrum-aware debiasing conjecture. Under suitable conditions, there is a unique solution of this equation and
Let be a lower bound on the information complexity, with respect to a fixed oracle, for a family of continuous, constrained convex optimization instances. Mixed-integer tran…
Non-integer convex-hull conjecture. Every vector satisfying that characterization should belong to
Non-integer characterization conjecture. A vector is optimal if and only if it has this decomposition and satisfies, for the relevant indices ,
Non-integer optimality conjecture. The set
Integer-case convex-hull conjecture. Every such vector should satisfy
Let be a bounded convex domain, and let the load be finitely supported. An optimal string system consists of a pair…
Closed-form worst-case conjecture. The worst-case performance satisfies
Let and be the operator-composed function classes defined in the source, and let and…