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.
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection (Q58075) (← links)
- Missing values: sparse inverse covariance estimation and an extension to sparse regression (Q80804) (← links)
- Estimation of high-dimensional graphical models using regularized score matching (Q138467) (← links)
- A higher-order LQ decomposition for separable covariance models (Q149116) (← links)
- Sparse Principal Component Analysis via Variable Projection (Q150980) (← links)
- Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- Greedy algorithms for prediction (Q265302) (← 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)
- The shooting S-estimator for robust regression (Q311279) (← links)
- A fast patch-dictionary method for whole image recovery (Q326397) (← links)
- Quadratic scalarization for decomposed multiobjective optimization (Q331788) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Distance metric learning guided adaptive subspace semi-supervised clustering (Q352041) (← links)
- A lasso for hierarchical interactions (Q366961) (← links)
- Geometry preserving multi-task metric learning (Q374164) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds (Q441196) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- Cyclic coordinate descent in a class of bang-singular-bang problems (Q491045) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- A new alternating direction method for linearly constrained nonconvex optimization problems (Q496618) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Schwarz iterative methods: infinite space splittings (Q530579) (← links)
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms (Q537241) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- \(\ell_{1}\)-penalization for mixture regression models (Q619141) (← links)
- The solution path of the generalized lasso (Q638794) (← links)
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (Q644904) (← links)
- Sparse non-negative tensor factorization using columnwise coordinate descent (Q645896) (← links)
- Graph optimization for dimensionality reduction with sparsity constraints (Q650966) (← links)
- Cyclic coordinate descent in hydrothermal nonsmooth problems (Q663492) (← links)
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications (Q683737) (← links)
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality (Q691483) (← links)
- SZ and CMB reconstruction using generalized morphological component analysis (Q713852) (← links)
- Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources (Q713913) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- A class of problems for which cyclic relaxation converges linearly (Q732240) (← links)
- An application of the algorithm of the cyclic coordinate descent in multidimensional optimization problems with constrained speed (Q735064) (← links)
- New cyclic sparsity measures for deconvolution based on convex relaxation (Q736973) (← links)
- Joint variable and rank selection for parsimonious estimation of high-dimensional matrices (Q741790) (← links)
- Majorization minimization by coordinate descent for concave penalized generalized linear models (Q746337) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- GMM based simultaneous reconstruction and segmentation in X-ray CT application (Q826217) (← links)
- Penalized logspline density estimation using total variation penalty (Q830579) (← links)
- Conditional score matching for high-dimensional partial graphical models (Q830589) (← links)
- Influence of forecasting electricity prices in the optimization of complex hydrothermal systems (Q843128) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
