The following pages link to (Q2880998):
Displaying 50 items.
- Stochastic forward-backward splitting for monotone inclusions (Q289110) (← links)
- Comprehensive comparative analysis and identification of RNA-binding protein domains: multi-class classification and feature selection (Q293789) (← links)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
- Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
- Smoothing proximal gradient method for general structured sparse regression (Q439167) (← links)
- Proximal methods for the latent group lasso penalty (Q457209) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- Sample size selection in optimization methods for machine learning (Q715253) (← links)
- Stochastic primal dual fixed point method for composite optimization (Q777039) (← links)
- Make \(\ell_1\) regularization effective in training sparse CNN (Q782914) (← links)
- Statistical properties of convex clustering (Q887272) (← links)
- An inertial forward-backward algorithm for monotone inclusions (Q890044) (← links)
- Feature-aware regularization for sparse online learning (Q893629) (← links)
- Sparse identification of posynomial models (Q894327) (← links)
- Tseng type methods for solving inclusion problems and its applications (Q1616141) (← links)
- Monotone operator theory in convex optimization (Q1650774) (← links)
- A closer look at consistent operator splitting and its extensions for topology optimization (Q1667461) (← links)
- On variance reduction for stochastic smooth convex optimization with multiplicative noise (Q1739038) (← links)
- Modified Fejér sequences and applications (Q1790672) (← links)
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems (Q1932970) (← links)
- Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations (Q1955536) (← links)
- Forward stability of ResNet and its variants (Q1988347) (← links)
- Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems (Q2007113) (← links)
- Convergence of stochastic proximal gradient algorithm (Q2019902) (← links)
- General convergence analysis of stochastic first-order methods for composite optimization (Q2032020) (← links)
- Modified forward-backward splitting method for variational inclusions (Q2040611) (← links)
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models (Q2048127) (← links)
- Convergence analysis of the stochastic reflected forward-backward splitting algorithm (Q2091216) (← links)
- An inertial semi-forward-reflected-backward splitting and its application (Q2115203) (← links)
- Modified Tseng's splitting algorithms for the sum of two monotone operators in Banach spaces (Q2133233) (← links)
- A parallel Tseng's splitting method for solving common variational inclusion applied to signal recovery problems (Q2167271) (← links)
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing (Q2173332) (← links)
- Three-operator splitting algorithm for a class of variational inclusion problems (Q2196426) (← links)
- Network classification with applications to brain connectomics (Q2281212) (← links)
- Robust and sparse regression in generalized linear model by stochastic optimization (Q2303494) (← links)
- On the linear convergence of the stochastic gradient method with constant step-size (Q2311205) (← links)
- An efficient primal dual prox method for non-smooth optimization (Q2339936) (← links)
- Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems (Q2340166) (← links)
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning (Q2358899) (← links)
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA (Q2363673) (← links)
- An accelerated variance reducing stochastic method with Douglas-Rachford splitting (Q2425236) (← links)
- The asymptotics of ranking algorithms (Q2438754) (← links)
- A new modified forward-backward-forward algorithm for solving inclusion problems (Q2678828) (← links)
- A novel algorithm for approximating common solution of a system of monotone inclusion problems and common fixed point problem (Q2691207) (← links)
- Transaction cost optimization for online portfolio selection (Q4554503) (← links)
- (Q4558495) (← links)
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
- A Tight Bound of Hard Thresholding (Q4558539) (← links)