How to Install and Uninstall libalgorithm-lbfgs-perl Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: February 03,2025

1. Install "libalgorithm-lbfgs-perl" package

Learn how to install libalgorithm-lbfgs-perl on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libalgorithm-lbfgs-perl
            
                    
    
    Copied

2. Uninstall "libalgorithm-lbfgs-perl" package

Please follow the guidance below to uninstall libalgorithm-lbfgs-perl on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libalgorithm-lbfgs-perl
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libalgorithm-lbfgs-perl package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libalgorithm-lbfgs-perl
Priority: optional
Section: universe/perl
Installed-Size: 60
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Perl Group
Architecture: amd64
Version: 0.16-2build1
Depends: perl (>= 5.22.1-1), perlapi-5.22.1, libc6 (>= 2.2.5), liblbfgs0
Filename: pool/universe/liba/libalgorithm-lbfgs-perl/libalgorithm-lbfgs-perl_0.16-2build1_amd64.deb
Size: 19944
MD5sum: 6f81db3de61e9270dae57b00ab75c690
SHA1: 6e99c3c07c282539817b7bfe3c31790c03163b03
SHA256: 04f16e27154fe1e3b905cb621fc15633dc079c6985a6e61424494daaacf8cce7
Description-en: Perl interface to an L-BFGS non-linear optimization algorithm
Algorithm::LBFGS is an interface to liblbfgs, a C implementation of L-BFGS.
.
L-BFGS (Limited-memory Broyden-Fletcher-Goldfarb-Shanno) is a quasi-Newton
method for unconstrained optimization. This method is especially efficient on
problems involving a large number of variables.
.
Generally, it solves a problem described as following:
.
min f(x), x = (x1, x2, ..., xn)
Description-md5: 764dc61b293928e13bd578bf760e50df
Homepage: https://metacpan.org/release/Algorithm-LBFGS
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu