The following pages link to Coordinate descent algorithms (Q2349114):
Displaying 50 items.
- An approximation method of CP rank for third-order tensor completion (Q2662903) (← links)
- Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
- Optimization of the first Dirichlet Laplacian eigenvalue with respect to a union of balls (Q2698557) (← links)
- Distributed coordinate descent method for learning with big data (Q2810888) (← 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)
- Shape Analysis of Functional Data (Q3300545) (← links)
- A Randomized Coordinate Descent Method with Volume Sampling (Q3300772) (← links)
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
- Iterative Proportional Scaling Revisited: A Modern Optimization Perspective (Q3391182) (← links)
- (Q3776414) (← links)
- (Q4558522) (← links)
- (Q4558572) (← links)
- Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466) (← links)
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods (Q4613501) (← links)
- Coordinate Descent Face-Off: Primal or Dual? (Q4617605) (← links)
- Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
- Interpolatory Methods for $$\mathcal{H}_{\infty }$$ Model Reduction of Multi-Input/Multi-Output Systems (Q4637171) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems (Q4641680) (← links)
- Randomized Gradient Boosting Machine (Q4971024) (← links)
- Sparse additive machine with ramp loss (Q4995049) (← links)
- Incremental CP Tensor Decomposition by Alternating Minimization Method (Q4997836) (← links)
- Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
- Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- (Q5053193) (← links)
- A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems (Q5061750) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization (Q5076711) (← links)
- Optimal regularizations for data generation with probabilistic graphical models (Q5078691) (← links)
- slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks (Q5095499) (← links)
- RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression (Q5099418) (← links)
- Fast deflation sparse principal component analysis via subspace projections (Q5107781) (← links)
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265) (← links)
- Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems (Q5109274) (← links)
- An investigation of Newton-Sketch and subsampled Newton methods (Q5135249) (← links)
- RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION (Q5149918) (← links)
- A Distributed Framework for the Construction of Transport Maps (Q5154132) (← links)
- ADDRESSING IMBALANCED INSURANCE DATA THROUGH ZERO-INFLATED POISSON REGRESSION WITH BOOSTING (Q5157763) (← links)
- (Q5159402) (← links)
- Random Batch Algorithms for Quantum Monte Carlo Simulations (Q5162364) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- Forecasting Multiple Time Series With One-Sided Dynamic Principal Components (Q5208073) (← links)
- CoordinateWise Descent Methods for Leading Eigenvalue Problem (Q5230665) (← links)
- Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme (Q5236622) (← links)
- An alternating minimization method for robust principal component analysis (Q5238069) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
- Blind Nonnegative Source Separation Using Biological Neural Networks (Q5380860) (← links)
