Awesome Open Source

Programming Languages

Search results for optimization semidefinite programming

semidefinite-programming x

19 search results found

Jump.jl ⭐ 2,093

Modeling language for Mathematical Optimization (linear, mixed-integer, conic, semidefinite, nonlinear)

Splitting Conic Solver

Cosmo.jl ⭐ 257

COSMO: Accelerated ADMM-based solver for convex conic optimisation problems (LP, QP, SOCP, SDP, ExpCP, PowCP). Automatic chordal decomposition of sparse semidefinite programs.

Clarabel.rs ⭐ 192

Clarabel.rs: Interior-point solver for convex conic optimisation problems in Rust.

Clarabel.jl ⭐ 141

Clarabel.jl: Interior-point solver for convex conic optimisation problems in Julia.

Nonconvex.jl ⭐ 100

Toolbox for gradient-based and derivative-free non-convex constrained optimization with continuous and/or discrete variables.

Proxsdp.jl ⭐ 84

Semidefinite programming optimization solver

PEPit is a package enabling computer-assisted worst-case analyses of first-order optimization methods.

Performance Estimation Toolbox ⭐ 49

Code of the Performance Estimation Toolbox (PESTO) whose aim is to ease the access to the PEP methodology for performing worst-case analyses of first-order methods in convex and nonconvex optimization. The numerical worst-case analyses from PEP can be performed just by writting the algorithms just as you would implement them.

Bayesian Optimization of Combinatorial Structures

Laplacianopt.jl ⭐ 24

A Julia/JuMP Package for Maximizing Algebraic Connectivity of Undirected Weighted Graphs

Markovbounds.jl ⭐ 14

A Julia package for the computation of hard, theoretically guaranteed bounds on the moments of jump-diffusion processes with polynomial data

Turbomachinery Rotors Balancing ⭐ 13

Python Tools to Practically Model and Solve the Problem of High Speed Rotor Balancing.

Clarabel.cpp ⭐ 12

Clarabel.cpp: C/C++ interface to the Clarabel Interior-point solver for convex conic optimisation problems.

Irene is a python package that aims to be a toolkit for global optimization problems that can be realized algebraically. It generalizes Lasserre's Relaxation method to handle theoretically any optimization problem with bounded feasibility set. The method is based on solutions of generalized truncated moment problems over commutative real algebras.

MICO: Mutual Information and Conic Optimization for feature selection

Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Semidefinite programming solver.

Clarabeldocs ⭐ 6

Documentation for the Clarabel interior point conic solver

An open-source add-on for YALMIP to solve optimisation problems with polynomial quadratic integral inequality constraints.

Related Searches

Python Optimization (2,356)

C Plus Plus Optimization (915)

Algorithms Optimization (824)

Jupyter Notebook Optimization (665)

Matlab Optimization (651)

Javascript Optimization (642)

Machine Learning Optimization (427)

C Optimization (412)

Julia Optimization (348)

Optimization Bayesian (240)

1-19 of 19 search results

Privacy | About | Terms | Follow Us On Twitter

Copyright 2018-2024 Awesome Open Source. All rights reserved.