L1Packv2: A Mathematica package for minimizing an _1-penalized functional

DOI10.1016/J.CPC.2008.07.010zbMATH Open1197.90007arXiv0710.3728OpenAlexW2152451437MaRDI QIDQ711066FDOQ711066

Authors: Ignace Loris 

Publication date: 25 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: L1Packv2 is a Mathematica package that contains a number of algorithms that can be used for the minimization of an $el{l}_1$-penalized least squares functional. The algorithms can handle a mix of penalized and unpenalized variables. Several instructive examples are given. Also, an implementation that yields an exact output whenever exact data are given is provided.

Full work available at URL: https://arxiv.org/abs/0710.3728

Recommendations

• On the performance of algorithms for the minimization of ℓ ₁ -penalized functionals
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• A modified local quadratic approximation algorithm for penalized optimization problems
• A coordinate majorization descent algorithm for \(\ell_1\) penalized learning
• A Projection Proximal-Point Algorithm for ℓ¹Minimization

zbMATH Keywords

inverse problemminimizationsparsitycompressed sensing\texttt{Mathematica}1-norm\texttt{L1Packv2}

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Cites Work

• Least angle regression. (With discussion)
• Title not available (Why is that?)
• Atomic Decomposition by Basis Pursuit
• A new approach to variable selection in least squares problems
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• An EM algorithm for wavelet-based image restoration
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Title not available (Why is that?)
• Sparse and stable Markowitz portfolios
• Title not available (Why is that?)
• Accelerated projected gradient method for linear inverse problems with sparsity constraints
• Linear Inversion of Band-Limited Reflection Seismograms
• A variational formulation for frame-based inverse problems
• On the performance of algorithms for the minimization of ℓ ₁ -penalized functionals

Cited In (2)

• L1Packv2
• The homotopy method revisited: computing solution paths of \(\ell_1\)-regularized problems

Uses Software

• Mathematica
• PDCO
• SparseLab

This page was built for publication: L1Packv2: A Mathematica package for minimizing an \(\ell _{1}\)-penalized functional

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711066)