PavelTrutman / polyopt
Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Semidefinite programming solver.
☆20Updated 7 years ago
Alternatives and similar repositories for polyopt:
Users that are interested in polyopt are comparing it to the libraries listed below
- Solver for Large-Scale Rank-One Semidefinite Relaxations☆68Updated 2 years ago
- This is the working repository for the CSDP project. CSDP is a solver for semidefinite programming problems. It is a COIN-OR project.☆58Updated 2 years ago
- Direct solver for sparse SPD matrices for nonlinear optimization. Implements supernodal Cholesky decomposition algorithm, and supports GP…☆88Updated last year
- A C++ Second Order Cone Solver based on Eigen☆32Updated 3 years ago
- Python interface for COSMO.jl convex optimisation solver.☆14Updated 3 years ago
- ROPTLIB: Riemannian Manifold Optimization Library☆72Updated 4 years ago
- A free LDL factorisation routine☆86Updated last month
- Documentation for the Clarabel interior point conic solver☆21Updated 8 months ago
- Differentiation through cone programs☆96Updated last week
- Python interface for SCS☆43Updated last month
- A sparse polynomial optimization tool based on the moment-SOS hierarchy.☆47Updated this week
- Clique recycling non-Gaussian (multi-modal) factor graph solver; also see Caesar.jl.☆73Updated last week
- Python interface for CUDA implementation of OSQP☆89Updated 3 years ago
- A set of lightweight header-only template functions implementing commonly-used optimization methods on Riemannian manifolds and convex sp…☆99Updated last year
- ☆18Updated last year
- A CVXPY extension for multi-convex programming☆45Updated last year
- APPM 5630 at CU Boulder☆45Updated last week
- A Proximal Interior Point Quadratic Programming solver☆97Updated this week
- ☆42Updated 4 years ago
- Python interface for OSQP☆112Updated this week
- Codac is a library for constraint programming over reals, trajectories and sets.☆40Updated this week
- A trust-region interior-point method for general nonlinear programing problems (GSoC 2017).☆36Updated 6 years ago
- A next-gen Lagrange-Newton solver for nonconvex constrained optimization. Unifies barrier and SQP methods in a generic way, and implement…☆311Updated last week
- Mathematical Modeling for Optimization and Machine Learning☆150Updated 4 months ago
- Bertini 2.0: The redevelopment of Bertini in C++.☆96Updated 2 weeks ago
- MIQP solver based on OSQP☆102Updated last year
- Trust Region Subproblem Solver Library☆19Updated 6 months ago
- Header only, C++ library (and the Python pyaudi package) implementing the algebra of Taylor truncated polynomials and a few algorithms us…☆75Updated 2 months ago
- Python interface to the QDLDL (https://github.com/osqp/qdldl) free LDL factorization routine for quasi-definite linear systems☆14Updated 3 weeks ago
- Library for handling various differentiable manifolds.☆52Updated last month