10 problems
- 0 votes0 replies0 views
Linear convergence of proximal iterations for Fréchet means on symmetric-perpendicular CAT() spaces
Let the data points lie in a symmetrically perpendicular CAT() space, and consider an iteration formed from compositions and convex combinations of proximal mappings of the…
- 0 votes0 replies0 views
Removal of regularity assumptions for proximal mappings in small CAT() spaces
Let a CAT() space have sufficiently small diameter that it is symmetric perpendicular, and let a fixed-point mapping be a self-mapping formed from compositions and convex c…
- 0 votes0 replies1 view
Global linear convergence of reasonable proximal iterations for Fréchet means
Let the underlying space be a Hadamard space, let the data points be points in that space, and consider an iteration formed from compositions and convex combinations of proximal ma…
- 0 votes0 replies0 views
Failure of the KL property under failure of strict complementarity
Let have rank , let be a global minimizer of with , and let…
- 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 replies0 views
Conjecture on the complexity estimate of Algorithm fla
Let Algorithm generate a sequence , and suppose that its Step is equivalently implemented using in place of. Complexity conjecture. The complexity estimate of Algorithm sh…
- 0 votes0 replies1 view
Conjectured improved convergence rate for the sparse variant
The sparse variant is an algorithmic variant of the variance-reduced three-operator splitting method discussed above; its iterates have a convergence rate measured as a function of…
- 0 votes0 replies0 views
The sharp subcritical convergence-rate conjecture for the inertial forward-backward algorithm
Sharp subcritical convergence-rate conjecture. Given the results obtained in the continuous case, one should have
- 0 votes0 replies0 views
Convergence of the proposed multi-splitting proximal algorithm
Convergence conjecture. The proposed algorithm can be used without concern about non-convergence; in particular, the sequence of iterates is expected to converg…
- 0 votes0 replies0 views
The restart conjecture for FISTA with nonsmooth regularizers
Restart conjecture. Restarting could improve the performance of FISTA even in the presence of nonsmooth regularizers.