Ctrl+K
- claim-1-algorithm-2-gradient-method-with-adaptive-polyak-stepsize-linear-convergence-o-log-1-epsilon
- claim-2-algorithm-3-dows-with-randomized-feasibility-o-1-sqrt-t-rate
- claim-3-algorithm-4-t-dows-removes-bounded-y-requirement-o-1-sqrt-t-up-to-log-factors
- claim-4-lemma-3-1-geometric-infeasibility-decay-under-randomized-feasibility-updates
- claim-5-qcqp-simulations-confirm-theory-on-function-decay-and-infeasibility-reduction
- claim-6-svm-classification-on-3-datasets-algorithms-3-4-vs-primal-dual-baseline
- conclusion
- executive-summary
- methods-provenance
- 1.42 kB