Pages that link to "Item:Q5945065"
From MaRDI portal
The following pages link to Convergence of a block coordinate descent method for nondifferentiable minimization (Q5945065):
Displaying 50 items.
- Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466) (← links)
- (Q4614121) (← links)
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (Q4624929) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
- Joint Multichannel Deconvolution and Blind Source Separation (Q4689650) (← links)
- Blind Source Separation with Outliers in Transformed Domains (Q4689770) (← links)
- $\ell _0$ Minimization for wavelet frame based image restoration (Q4912013) (← links)
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent (Q4916947) (← links)
- An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions (Q4960646) (← links)
- (Q4969198) (← links)
- Structural Pursuit Over Multiple Undirected Graphs (Q4975637) (← links)
- Incremental CP Tensor Decomposition by Alternating Minimization Method (Q4997836) (← links)
- (Q4998931) (← links)
- Adaptive elastic-net selection in a quantile model with diverging number of variable groups (Q4999858) (← links)
- Learning optical flow for fast MRI reconstruction (Q5006376) (← links)
- Efficient computation of mean reverting portfolios using cyclical coordinate descent (Q5014198) (← links)
- A non-convex regularization approach for stable estimation of loss development factors (Q5014498) (← links)
- Time-Varying Autoregression with Low-Rank Tensors (Q5016785) (← links)
- Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
- Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)
- Model selection with distributed SCAD penalty (Q5036460) (← links)
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
- On the uniqueness of solutions for the basis pursuit in the continuum (Q5044980) (← links)
- Robust low-rank tensor factorization by cyclic weighted median (Q5046469) (← links)
- Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity (Q5051381) (← links)
- (Q5053179) (← links)
- (Q5053183) (← links)
- A Scalable Hierarchical Lasso for Gene–Environment Interactions (Q5057242) (← links)
- Acceleration of block coordinate descent method achieves the $\bm{O(\frac{1}{k^2})}$ rate of convergence for a convex function with block coordinate strong convexity (Q5063626) (← links)
- A modified multinomial baseline logit model with logit functions having different covariates (Q5083903) (← links)
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
- Exact Penalization of Generalized Nash Equilibrium Problems (Q5095151) (← links)
- A primal dual active set with continuation algorithm for high-dimensional nonconvex SICA-penalized regression (Q5107360) (← links)
- A modified information criterion for tuning parameter selection in 1d fused LASSO for inference on multiple change points (Q5107787) (← links)
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265) (← links)
- Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints (Q5108481) (← links)
- Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model (Q5109282) (← links)
- Additive Schwarz Methods for Convex Optimization as Gradient Methods (Q5110553) (← links)
- Grouped penalization estimation of the osteoporosis data in the traditional Chinese medicine (Q5128952) (← links)
- Independently Interpretable Lasso for Generalized Linear Models (Q5131139) (← links)
- High-dimensional index tracking based on the adaptive elastic net (Q5139249) (← links)
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778) (← links)
- Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization (Q5144794) (← links)
- Mixed-Effect Time-Varying Network Model and Application in Brain Connectivity Analysis (Q5146050) (← links)
- (Q5149027) (← links)
- (Q5152646) (← links)
- (Q5155916) (← links)
- (Q5159402) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
