How to Install and Uninstall ceres-solver.x86_64 Package on Red Hat Enterprise Linux 8 (RHEL 8)

Last updated: November 11,2024

1. Install "ceres-solver.x86_64" package

In this section, we are going to explain the necessary steps to install ceres-solver.x86_64 on Red Hat Enterprise Linux 8 (RHEL 8)


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                ceres-solver.x86_64
            
                    
    
    Copied

2. Uninstall "ceres-solver.x86_64" package

This guide let you learn how to uninstall ceres-solver.x86_64 on Red Hat Enterprise Linux 8 (RHEL 8):


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                ceres-solver.x86_64
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the ceres-solver.x86_64 package on Red Hat Enterprise Linux 8 (RHEL 8)

Last metadata expiration check: 0:02:00 ago on Mon Feb 26 15:59:38 2024.
Available Packages
Name : ceres-solver
Version : 1.14.0
Release : 4.el8
Architecture : x86_64
Size : 667 k
Source : ceres-solver-1.14.0-4.el8.src.rpm
Repository : epel
Summary : A non-linear least squares minimizer
URL : http://ceres-solver.org/
License : BSD
Description :
: Ceres Solver is an open source C++ library for modeling and solving
: large, complicated optimization problems. It is a feature rich, mature
: and performant library which has been used in production at Google
: since 2010. Notable use of Ceres Solver is for the image alignment in
: Google Maps and for vehicle pose in Google Street View. Ceres Solver
: can solve two kinds of problems.
:
: 1. Non-linear Least Squares problems with bounds constraints.
: 2. General unconstrained optimization problems.
:
: Features include:
:
: - A friendly API: build your objective function one term at a time
: - Automatic and numeric differentiation
: - Robust loss functions
: - Local parameterizations
: - Threaded Jacobian evaluators and linear solvers
: - Trust region solvers with non-monotonic steps (Levenberg-Marquardt and
: Dogleg (Powell & Subspace))
: - Line search solvers (L-BFGS and Nonlinear CG)
: - Dense QR and Cholesky factorization (using Eigen) for small problems
: - Sparse Cholesky factorization (using SuiteSparse) for large sparse problems
: - Specialized solvers for bundle adjustment problems in computer vision
: - Iterative linear solvers for general sparse and bundle adjustment problems
: - Runs on Linux, Windows, Mac OS X, Android, and iOS