An inexact semismooth Newton-based augmented Lagrangian algorithm for multi-task Lasso problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Convex Analysis
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- Monotone Operators and the Proximal Point Algorithm
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Proximité et dualité dans un espace hilbertien
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Semismooth Matrix-Valued Functions
- Some continuity properties of polyhedral multifunctions
- Variational Analysis
This page was built for publication: An inexact semismooth Newton-based augmented Lagrangian algorithm for multi-task Lasso problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968690)
