Section: robotpkg/optimization
Priority: extra
Maintainer: roboptim@googlegroups.com
Source: /opt/robotpkg/var/lib/robotpkg/packages/bsd/Ubuntu-26.04-x86_64/pub/roboptim-core-3.1r2.tgz
Package: robotpkg-roboptim-core
Version: 3.1r2
Architecture: amd64
Homepage: http://www.roboptim.net
Depends: libboost-filesystem1.90-dev (>= 1.34.1), libboost-filesystem1.90.0 (>= 1.34.1), libboost-iostreams1.90-dev (>= 1.34.1), libboost-iostreams1.90.0 (>= 1.34.1), libboost-math1.90-dev (>= 1.34.1), libboost-math1.90.0 (>= 1.34.1), libboost-thread1.90-dev (>= 1.34.1), libboost-thread1.90.0 (>= 1.34.1), libstdc++6, libtool-bin (>= 1.5.22), libltdl-dev (>= 1.5.22), liblog4cxx-dev (>= 0.10)
Conflicts: robotpkg-roboptim-core
Provides: robotpkg-roboptim-core
Replaces: robotpkg-roboptim-core
Description: Optimization for robotics: common API to various solvers
 License: gnu-lgpl-v3
 Debian-Packager: robotpkg@laas.fr
 roboptim is a C++ generic non-linear optimization library for robotics composed of 3
 levels:
   - core
   - posture
   - trajectory
 .
 The core level allows users to define non-linear optimization problems
 in a generic way in order to use different back-ends. Currently the
 supported solvers are
   * cfsqp
   * ipopt
 .
 A non-linear optimization problem can be expressed as follows:
 .
   min f(x), x in R^n, Ce(x) = 0, Ci(x)<= 0
 .
 where 
   - f is a scalar mapping defined over R^n, 
   - Ce (equality constraints) is a mapping from R^n to R^m,
   - Ci (inequality constraint) is a mapping from R^n to R^p.
 .
 Homepage:
 http://www.roboptim.net

