Skip to content

Sums-of-Squares optimization in Julia, powered by JuMP

License

Notifications You must be signed in to change notification settings

rdeits/Mayday.jl

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

63 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Mayday

Build Status Build status codecov.io

Mayday.jl is a naïve implementation of sums-of-squares (SoS) polynomial optimization through semidefinite programming (SDP), powered by JuMP and Julia.

SoS programming is used in control theory to search for controllers for a dynamical system (like a robot or airplane) and to find the set of states for which those controllers will be valid. To learn more about how SoS programming is used, check out http:https://underactuated.csail.mit.edu/underactuated.html?chapter=11

Requirements

To use this package, you'll need an SDP solver with a JuMP interface. If you installed Mayday with Pkg.add(), then you've already gotten SCS.jl, a wrapper for the free SCS solver, and you're all set. You may also want to install Mosek, a proprietary solver, with Pkg.add("Mosek"). Mosek requires a license, but is free for academic use: https://mosek.com/introduction/buy-mosek and is generally faster.

Usage

Check out the examples folder for demonstrations.

About

Sums-of-Squares optimization in Julia, powered by JuMP

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •  

Languages