2 个仓库
Optimization solvers that handle binary variables and convex constraints using branch-and-bound methods.
Distinct from Mathematical Problem Solving Toolkits: Specifically handles mixed-integer convex problems, distinct from general problem-solving toolkits.
Explore 2 awesome GitHub repositories matching scientific & mathematical computing · Mixed-Integer Convex Solvers. Refine with filters or upvote what's useful.
CVXPY is a Python-embedded domain-specific language for modeling and solving convex optimization problems using natural mathematical syntax. It is built on a disciplined convex programming framework that automatically enforces convexity rules, ensuring that problems formulated by the user are valid for convex solvers. The project also functions as a multi-solver optimization interface, abstracting away backend details and dispatching problems to specialized solvers like ECOS, SCS, and Gurobi without manual configuration. Beyond standard convex optimization, CVXPY extends its reach to geometri
Transforms mixed-integer problems into forms accepted by solvers while preserving convex structure.
Drake is a robotics simulation framework and control system modeling tool used for designing, simulating, and verifying the dynamics of complex robotic systems. It functions as a multibody dynamics simulator and a mathematical optimization library, providing a suite of algorithms for trajectory optimization and the simulation of articulated robots. The framework is distinguished by its block-diagram system for composing dynamical subsystems and its ability to formulate and solve diverse mathematical programs, including linear, quadratic, and nonconvex nonlinear problems. It supports specializ
Handles optimization problems containing binary variables using specialized solvers or branch-and-bound algorithms.