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):
Displayed 50 items.
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- On the optimal order of worst case complexity of direct search (Q276315) (← links)
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- Empirical likelihood confidence tubes for functional parameters in plug-in estimation (Q321919) (← links)
- On N. Z. Shor's three scientific ideas (Q380646) (← links)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Schwarz iterative methods: infinite space splittings (Q530579) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- iPiasco: inertial proximal algorithm for strongly convex optimization (Q890114) (← links)
- Subspace correction methods in algebraic multi-level frames (Q896866) (← links)
- On the relation between the randomized extended Kaczmarz algorithm and coordinate descent (Q906948) (← links)
- Solving norm constrained portfolio optimization via coordinate-wise descent algorithms (Q1623568) (← links)
- Stochastic accelerated alternating direction method of multipliers with importance sampling (Q1626518) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
- Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization (Q1675555) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Duality and nonlinear graph Laplacians (Q1694674) (← links)
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes (Q1711086) (← links)
- Generalization of a result of Fabian on the asymptotic normality of stochastic approximation (Q1716693) (← links)
- Linear convergence of the randomized sparse Kaczmarz method (Q1717238) (← links)
- Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization (Q1734766) (← links)
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence (Q1739044) (← links)
- A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates (Q1744044) (← links)
- Robust multicategory support vector machines using difference convex algorithm (Q1749454) (← links)
- Adaptively weighted large-margin angle-based classifiers (Q1750000) (← links)
- Multi-label Lagrangian support vector machine with random block coordinate descent method (Q1750531) (← links)
- Matrix completion under interval uncertainty (Q1752160) (← links)
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069) (← links)
- An optimal randomized incremental gradient method (Q1785198) (← links)
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- A coordinate descent method for total variation minimization (Q1992568) (← links)
- A geometric probability randomized Kaczmarz method for large scale linear systems (Q1995943) (← links)
- Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
