Pages that link to "Item:Q5077024"
From MaRDI portal
The following pages link to Randomized sketch descent methods for non-separable linearly constrained optimization (Q5077024):
Displaying 10 items.
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
- A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
- Random projections of linear and semidefinite problems with linear inequalities (Q2689146) (← links)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution (Q6071888) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition (Q6202283) (← links)
- Randomized methods for computing optimal transport without regularization and their convergence analysis (Q6571381) (← links)
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation (Q6592907) (← links)
