The following pages link to Coordinate descent algorithms (Q2349114):
Displaying 50 items.
- Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (Q2104022) (← links)
- Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
- On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces (Q2115326) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection (Q2127557) (← links)
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training (Q2132578) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- Revealing hidden dynamics from time-series data by ODENet (Q2138013) (← links)
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
- Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
- Block layer decomposition schemes for training deep neural networks (Q2173515) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- The blockwise coordinate descent method for integer programs (Q2189480) (← links)
- Testing and non-linear preconditioning of the proximal point method (Q2198162) (← links)
- Synchronous parallel block coordinate descent method for nonsmooth convex function minimization (Q2200102) (← links)
- A safe reinforced feature screening strategy for Lasso based on feasible solutions (Q2201661) (← links)
- Bregman Itoh-Abe methods for sparse optimisation (Q2203362) (← links)
- Asynchronous parallel algorithms for nonconvex optimization (Q2205974) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- Use of projective coordinate descent in the Fekete problem (Q2207557) (← links)
- Compressive sensing adaptation for polynomial chaos expansions (Q2214527) (← links)
- Primal-dual block-proximal splitting for a class of non-convex problems (Q2218923) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- Random batch methods (RBM) for interacting particle systems (Q2222655) (← links)
- Coercing machine learning to output physically accurate results (Q2223280) (← links)
- Bregman reweighted alternating minimization and its application to image deblurring (Q2224931) (← links)
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems (Q2225527) (← links)
- On convergence rate of the randomized Gauss-Seidel method (Q2228499) (← links)
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (Q2235160) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Low-rank matrix approximation in the infinity norm (Q2273885) (← links)
- Shortest Dubins paths through three points (Q2280708) (← links)
- Gesture-driven LEGO robots (Q2283733) (← links)
- Non-parametric learning of lifted restricted Boltzmann machines (Q2310287) (← links)
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
- An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization (Q2322371) (← links)
- Block-proximal methods with spatially adapted acceleration (Q2323015) (← links)
- Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
- Unsupervised learning of pharmacokinetic responses (Q2358927) (← links)
- AIR tools II: algebraic iterative reconstruction methods, improved implementation (Q2413493) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← 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)
- Convergence rates of accelerated proximal gradient algorithms under independent noise (Q2420162) (← links)
- An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso (Q2423178) (← links)
- Robust multicategory support matrix machines (Q2425180) (← links)
- Distributed nonconvex constrained optimization over time-varying digraphs (Q2425183) (← links)
- Coordinate descent algorithms for lasso penalized regression (Q2482976) (← links)
