Sale!

MATLAB implementation of the homotopy algorithm for solving the Lasso

19

Description

a MATLAB implementation of the homotopy algorithm for solving the Lasso with its variant presented in the ICML paper.

When the parameter eps equals zero, it is the exact homotopy algorithm.

When eps > 0, it uses the approximate homotopy variant (only works on linux 64bits computers).

Note that this implementation is designed to privilege numerical precision over speed.

For faster (but less numerically stable) implementation of the homotopy, see the  software package SPAMS: http://www.di.ens.fr/willow/SPAMS/

MATLAB Implementation of segmentation-based disparity averaging

MATLAB implementation of accumulator-based raw disparity computation

 

 

Reviews

There are no reviews yet.

Be the first to review “MATLAB implementation of the homotopy algorithm for solving the Lasso”

Your email address will not be published. Required fields are marked *

SKU: P2018F228 Category: