Pages that link to "Item:Q5945065"

The following pages link to Convergence of a block coordinate descent method for nondifferentiable minimization (Q5945065):

Displaying 50 items.

• Risk-averse policy optimization via risk-neutral policy optimization (Q2082514) (← links)
• High-dimensional linear regression with hard thresholding regularization: theory and algorithm (Q2097492) (← links)
• Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
• On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
• A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
• Penalized polygram regression (Q2111959) (← links)
• Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
• Adaptive log-density estimation (Q2131904) (← links)
• On obtaining sparse semantic solutions for inverse problems, control, and neural network training (Q2132578) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• Distributed identification of heterogeneous treatment effects (Q2135843) (← links)
• A new double-regularized regression using Liu and Lasso regularization (Q2135849) (← links)
• An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units (Q2135867) (← links)
• Convergence of incentive-driven dynamics in Fisher markets (Q2155906) (← links)
• Sparse latent factor regression models for genome-wide and epigenome-wide association studies (Q2162483) (← links)
• Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
• Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
• Estimation of multivariate dependence structures via constrained maximum likelihood (Q2163514) (← links)
• Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
• Sparse probabilistic K-means (Q2185434) (← links)
• The blockwise coordinate descent method for integer programs (Q2189480) (← links)
• Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding (Q2193348) (← links)
• Synchronous parallel block coordinate descent method for nonsmooth convex function minimization (Q2200102) (← links)
• An efficient method for clustered multi-metric learning (Q2200672) (← links)
• Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data (Q2203366) (← links)
• Autoregressive identification of Kronecker graphical models (Q2207183) (← links)
• The conditional censored graphical Lasso estimator (Q2209704) (← links)
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
• Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery (Q2233190) (← links)
• Sparse regression for large data sets with outliers (Q2242288) (← links)
• Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
• A hierarchical multiple kernel support vector machine for customer churn prediction using longitudinal behavioral data (Q2253363) (← links)
• Additive models with trend filtering (Q2284363) (← links)
• Efficient computation for differential network analysis with applications to quadratic discriminant analysis (Q2291319) (← links)
• Robust Schatten-\(p\) norm based approach for tensor completion (Q2291931) (← links)
• ROS regression: integrating regularization with optimal scaling regression (Q2292391) (← links)
• Lasso meets horseshoe: a survey (Q2292393) (← links)
• Regularized estimation of precision matrix for high-dimensional multivariate longitudinal data (Q2293546) (← links)
• Logical and test consistency in pairwise multiple comparisons (Q2301083) (← links)
• A variational proximal alternating linearized minimization in a given metric for limited-angle CT image reconstruction (Q2307219) (← links)
• A single image dehazing model using total variation and inter-channel correlation (Q2308515) (← links)
• Multivariate Gaussian network structure learning (Q2317263) (← links)
• Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging (Q2320461) (← links)
• Optimal replenishment order placement in a finite time horizon (Q2342144) (← links)
• Convergence analysis for iterative data-driven tight frame construction scheme (Q2343256) (← links)
• Coordinate descent algorithms (Q2349114) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
• Structured regularization for conditional Gaussian graphical models (Q2361457) (← links)
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)