Alternating direction multiplier method for matrix l₂,1-norm optimization in multitask feature learning problems
DOI10.1155/2020/4864296zbMATH Open1459.65084OpenAlexW3081372833MaRDI QIDQ2007113FDOQ2007113
Yujie Wang, Yaping Hu, Liying Liu
Publication date: 12 October 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/4864296
Recommendations
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning
- A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
- Least absolute deviations learning of multiple tasks
- Algorithmic study of \(l_{2,1}\)-norm minimization problems
- scientific article; zbMATH DE number 7312307
Numerical mathematical programming methods (65K05) Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Applications of mathematical programming (90C90)
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- On the global and linear convergence of the generalized alternating direction method of multipliers
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- The Split Bregman Method for L1-Regularized Problems
- The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- Sparse regression using mixed norms
- Title not available (Why is that?)
- Efficient online and batch learning using forward backward splitting
- Convex multi-task feature learning
- Consensus-based distributed support vector machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning
- A regularized alternating direction method of multipliers for a class of nonconvex problems
Cited In (1)
This page was built for publication: Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007113)