Pages that link to "Item:Q2910875"
From MaRDI portal
The following pages link to Efficiency of coordinate descent methods on huge-scale optimization problems (Q2910875):
Displaying 50 items.
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (Q2235160) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Accelerated directional search with non-Euclidean prox-structure (Q2290400) (← links)
- Markov chain block coordinate descent (Q2301127) (← links)
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
- Variant of greedy randomized Kaczmarz for ridge regression (Q2311776) (← links)
- Randomized primal-dual proximal block coordinate updates (Q2314059) (← links)
- Randomized and fault-tolerant method of subspace corrections (Q2319625) (← links)
- Block-proximal methods with spatially adapted acceleration (Q2323015) (← links)
- Feature selection method based on partial least squares and analysis of traditional Chinese medicine data (Q2330206) (← links)
- Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework (Q2347471) (← links)
- Coordinate descent algorithms (Q2349114) (← links)
- On efficient randomized algorithms for finding the PageRank vector (Q2354453) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
- Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
- Unsupervised learning of pharmacokinetic responses (Q2358927) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- Random gradient-free minimization of convex functions (Q2397749) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← 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)
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
- On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- New method for solving Ivanov regularization-based support vector machine learning (Q2669598) (← links)
- On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems (Q2686517) (← links)
- An efficient inexact ABCD method for least squares semidefinite programming (Q2805705) (← links)
- Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
- Distributed coordinate descent method for learning with big data (Q2810888) (← links)
- A second-order method for convex<sub>1</sub>-regularized optimization with active-set prediction (Q2815550) (← links)
- ARock: an algorithmic framework for asynchronous parallel coordinate updates (Q2821779) (← links)
- Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup> (Q2829565) (← links)
- Coordinate descent with arbitrary sampling II: expected separable overapproximation (Q2829566) (← links)
- On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent (Q2832112) (← links)
- Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← links)
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
- Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization (Q2954396) (← links)
- Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems (Q2957979) (← links)
- Introduction: Big data and partial differential equations (Q3133605) (← links)
- A Randomized Coordinate Descent Method with Volume Sampling (Q3300772) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
