12 problems
- 0 votes0 replies1 view
Exactness of the three sublinear DCA rates
Let denote the first three parameter regimes in the sublinear convergence result for DCA, and let be the number of iterations. Exact-rate conjecture. The DCA rate…
- 0 votes0 replies0 views
Geometric interpolation conjecture for EXTRA performance guarantees
Geometric interpolation conjecture. For all , , and , the mixed-conditioning performance satisfies
- 0 votes0 replies0 views
Quadratic attainment conjecture for GM, FBS1, FBS2, and PRS
Let and belong to the function classes and , respectively, and consider the optimization problem … Here GM, F…
- 0 votes0 replies1 view
Closed-form worst-case conjecture for gradient descent on
Closed-form worst-case conjecture. The worst-case performance satisfies
- 0 votes0 replies0 views
One-dimensional worst-case conjecture for gradient descent on composed operator classes
Let and be the operator-composed function classes defined in the source, and let and…
- 0 votes0 replies1 view
Taylor et al.'s one-dimensional worst-case conjecture for gradient descent on smooth strongly convex functions
Let , , and let be the class of functions with the smoothness and strong-convexity parameters specified in the source. Let…
- 0 votes0 replies0 views
The -optimality conjecture for OBL-G
OBL-G's -optimality conjecture. OBL-G is -optimal in the sense that
- 0 votes0 replies0 views
Nonconvergence conjecture for IGA in the general h-smooth setting
Let belong to the class of pairs satisfying the general -smoothness assumptions, and consider IGA with a step size in . IGA nonconvergence co…
- 0 votes0 replies0 views
Low-rank dual solution conjecture for operator splitting performance estimation
Let denote an optimal solution of the dual operator-splitting performance estimation problem. Low-rank dual solution conjecture. The optimal solu…
- 0 votes0 replies0 views
Two-dimensional worst-case operator conjecture for operator splitting
Let the primal operator-splitting performance estimation problem be solved symbolically, and let the worst-case operators denote operators attaining its worst-case contraction fact…
- 0 votes0 replies0 views
Optimized composite-gradient FPGM coefficients solve the relaxed PEP
Composite-gradient FPGM conjecture. The solution corresponds to the coefficients defined by the FPGM construction in with the above choice of .
- 0 votes0 replies1 view
FISTA coefficients globally minimize the relaxed cost-function PEP
FISTA global-minimizer conjecture. The feasible point with that corresponds to FPGM (FISTA) is a global minimizer of the relaxed problem defining…