PavelTrutman / polyopt
Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Semidefinite programming solver.
☆18Updated 6 years ago
Related projects: ⓘ
- Solver for Large-Scale Rank-One Semidefinite Relaxations☆66Updated last year
- This is the working repository for the CSDP project. CSDP is a solver for semidefinite programming problems. It is a COIN-OR project.☆54Updated 2 years ago
- Direct solver for sparse SPD matrices for nonlinear optimization. Implements supernodal Cholesky decomposition algorithm, and supports GP…☆83Updated last year
- ROPTLIB: Riemannian Manifold Optimization Library☆68Updated 4 years ago
- Codac is a library for constraint programming over reals, trajectories and sets.☆39Updated 4 months ago
- Python interface for COSMO.jl convex optimisation solver.☆13Updated 2 years ago
- A C++ Second Order Cone Solver based on Eigen☆32Updated 3 years ago
- A free LDL factorisation routine☆78Updated last month
- A set of lightweight header-only template functions implementing commonly-used optimization methods on Riemannian manifolds and convex sp…☆94Updated 10 months ago
- Python interface for SCS☆40Updated this week
- Clique recycling non-Gaussian (multi-modal) factor graph solver; also see Caesar.jl.☆72Updated last week
- PLEASE SEE THE OFFICIAL REPOSITORY. THIS IS NOT MAINTAINED ANYMORE.☆93Updated 4 years ago
- Bertini 2.0: The redevelopment of Bertini in C++.☆90Updated last month
- A CVXPY extension for multi-convex programming☆45Updated last year
- A Jupyter-notebook based article investigating (useful parameter settings for) the Unscented Kalman Filter (UKF).☆28Updated 8 years ago
- Library for handling various differentiable manifolds.☆52Updated 3 weeks ago
- FastAD is a C++ implementation of automatic differentiation both forward and reverse mode.☆98Updated 11 months ago
- APPM 5630 at CU Boulder☆42Updated 7 months ago
- The analysis and implementation of SO3 log map, and its jacobians. The special focus on edge cases (angle close to 0 or \pi).☆22Updated 9 months ago
- QRKit is an extension of Eigen C++ library that allows for efficient QR decomposition of sparse matrices with common sparsity patterns.☆15Updated 3 years ago
- ☆42Updated 4 years ago
- Trust Region Subproblem Solver Library☆19Updated last month
- Parallel solvers for optimization problems☆73Updated 3 years ago
- A sparse polynomial optimization tool based on the moment-SOS hierarchy.☆38Updated this week
- A Proximal Interior Point Quadratic Programming solver☆84Updated last week
- TMAC: A Toolbox of Modern Async-Parallel, Coordinate, Splitting, and Stochastic Methods☆45Updated 7 years ago
- Robust robotic localization and mapping, together with NavAbility(TM). Reach out to info@wherewhen.ai for help.☆184Updated last week
- A trust-region interior-point method for general nonlinear programing problems (GSoC 2017).☆35Updated 6 years ago
- Differentiation through cone programs☆89Updated 2 weeks ago
- Fast Fourier transform on SO(3)☆27Updated 2 years ago