2 problems
- 0 votes0 replies0 views
Iteration-count conjecture for NL-IAPIAL
The methods NL-IAPIAL, QP-AIPP, and iALM are iterative algorithms for solving the optimization problems considered in the paper. Iteration-count conjecture for NL-IAPIAL. NL-IAPIAL…
- 0 votes0 replies0 views
The impossibility conjecture for an cyclic BCGD bound
Let cyclic BCGD denote cyclic block coordinate gradient descent for general convex problems, and let and be the parameters used in its iteration-complexity bound. Impossibi…