GitPlanet

Cheap and reliable Node.js hosting starts at $3/month, and $1/month static HTML hosting

Created with love in Canada, visit hostnodejs.com today

Feel like to post an Ad? Learn Details
All Projects → oxfordcontrol → Osqp

oxfordcontrol / Osqp

Licence: apache-2.0
The Operator Splitting QP Solver

Programming Languages

c
50402 projects - #5 most used programming language

Labels

machine-learningoptimizationcontrolsvmsolver

Projects that are alternatives of or similar to Osqp

osqp
The Operator Splitting QP Solver
Stars: ✭ 929 (+34.83%)
Mutual labels:  control, optimization, svm, solver
CSDP.jl
Julia Wrapper for CSDP (https://projects.coin-or.org/Csdp/)
Stars: ✭ 18 (-97.39%)
Mutual labels:  optimization, solver
Optaplanner
AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.
Stars: ✭ 2,454 (+256.17%)
Mutual labels:  solver, optimization
Cppnumericalsolvers
a lightweight C++17 library of numerical optimization methods for nonlinear functions (Including L-BFGS-B for TensorFlow)
Stars: ✭ 638 (-7.4%)
Mutual labels:  solver, optimization
Angler
Frequency-domain photonic simulation and inverse design optimization for linear and nonlinear devices
Stars: ✭ 75 (-89.11%)
Mutual labels:  solver, optimization
Hiop
HPC solver for nonlinear optimization problems
Stars: ✭ 75 (-89.11%)
Mutual labels:  solver, optimization
Vroom
Vehicle Routing Open-source Optimization Machine
Stars: ✭ 533 (-22.64%)
Mutual labels:  solver, optimization
IterativeLQR.jl
A Julia package for constrained iterative LQR (iLQR)
Stars: ✭ 15 (-97.82%)
Mutual labels:  control, optimization
cplex-example
Solving a TSP with the CPLEX C++ API.
Stars: ✭ 40 (-94.19%)
Mutual labels:  optimization, solver
Totsu
First-order conic solver for convex optimization problems
Stars: ✭ 18 (-97.39%)
Mutual labels:  optimization, solver
qpmad
ROS-compatible Eigen-based Goldfarb-Idnani quadratic programming solver
Stars: ✭ 41 (-94.05%)
Mutual labels:  optimization, solver
Prioritizr
Systematic conservation prioritization in R
Stars: ✭ 62 (-91%)
Mutual labels:  solver, optimization
Acados
Fast and embedded solvers for nonlinear optimal control
Stars: ✭ 194 (-71.84%)
Mutual labels:  optimization, control
Cosmo.jl
COSMO: Accelerated ADMM-based solver for convex conic optimisation problems (LP, QP, SOCP, SDP, ExpCP, PowCP). Automatic chordal decomposition of sparse semidefinite programs.
Stars: ✭ 149 (-78.37%)
Mutual labels:  solver, optimization
Grl
Robotics tools in C++11. Implements soft real time arm drivers for Kuka LBR iiwa plus V-REP, ROS, Constrained Optimization based planning, Hand Eye Calibration and Inverse Kinematics integration.
Stars: ✭ 105 (-84.76%)
Mutual labels:  optimization, control
ProxSDP.jl
Semidefinite programming optimization solver
Stars: ✭ 69 (-89.99%)
Mutual labels:  optimization, solver
Spot mini mini
Dynamics and Domain Randomized Gait Modulation with Bezier Curves for Sim-to-Real Legged Locomotion.
Stars: ✭ 426 (-38.17%)
Mutual labels:  optimization, control
Hyperparameter Optimization Of Machine Learning Algorithms
Implementation of hyperparameter optimization/tuning methods for machine learning & deep learning models (easy&clear)
Stars: ✭ 516 (-25.11%)
Mutual labels:  svm, optimization
Solid
🎯 A comprehensive gradient-free optimization framework written in Python
Stars: ✭ 546 (-20.75%)
Mutual labels:  optimization
Better Monadic For
Desugaring scala `for` without implicit `withFilter`s
Stars: ✭ 622 (-9.72%)
Mutual labels:  optimization
View All Similar Projects ➔

The Operator Splitting QP Solver

Build status of the master branch on Linux/OSX Build status of the master branch on Windows Code coverage License

PyPI - downloads Conda - downloads

Join our forum on Discourse for any questions related to the solver!

The documentation is available at osqp.org

The OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving problems in the form

minimize        0.5 x' P x + q' x

subject to      l <= A x <= u

where x in R^n is the optimization variable. The objective function is defined by a positive semidefinite matrix P in S^n_+ and vector q in R^n. The linear constraints are defined by matrix A in R^{m x n} and vectors l and u so that l_i in R U {-inf} and u_i in R U {+inf} for all i in 1,...,m.

The latest version is 0.6.2.

Citing OSQP

If you are using OSQP for your work, we encourage you to

We are looking forward to hearing your success stories with OSQP! Please share them with us.

Bug reports and support

Please report any issues via the Github issue tracker. All types of issues are welcome including bug reports, documentation typos, feature requests and so on.

Numerical benchmarks

Numerical benchmarks against other solvers are available here.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].