Selective linearization for multi-block statistical learning
type: Item
instance of: scholarly article
title: Selective linearization for multi-block statistical learning
zbMATH Open document ID: 1487.65064
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 7356019
zbMATH Keywords: nonlinear programming
zbMATH Keywords: statistical learning
zbMATH Keywords: penalized regression
zbMATH Keywords: regularized support vector machine
describes a project that uses: UCI-ml
describes a project that uses: SMOTE
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.12.010
OpenAlex ID: W3112330086
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
cites work: An augmented Lagrangian method for distributed optimization
cites work: Q4533353
cites work: Smoothing proximal gradient method for general structured sparse regression
cites work: Proximal average approximated incremental gradient descent for composite penalty regularized empirical risk minimization
cites work: Parallel multi-block ADMM with \(o(1/k)\) convergence
cites work: A Selective Linearization Method For Multiblock Convex Optimization
cites work: Rate of convergence of the bundle method
cites work: Fast alternating linearization methods for minimizing the sum of two convex functions
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: Proximal Decomposition Via Alternating Linearization
cites work: Q2934136
cites work: Operations research and data mining
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q3376534
cites work: Proximal methods for the latent group lasso penalty
cites work: Global convergence of ADMM in nonconvex nonsmooth optimization
cites work: Application of SVM and ANN for image retrieval
cites work: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
cites work: Regularization and Variable Selection Via the Elastic Net
DOI: 10.1016/J.EJOR.2020.12.010
description: scientific article; zbMATH DE number 7356019