Pages that link to "Item:Q4575711"
From MaRDI portal
The following pages link to Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver (Q4575711):
Displaying 8 items.
- An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture (Q2035530) (← links)
- Robust sub-Gaussian estimation of a mean vector in nearly linear time (Q2119240) (← links)
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
- (Q5089186) (← links)
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
