Pinned Repositories
Ipopt
COIN-OR Interior Point Optimizer IPOPT
PIPAL
Penalty-Interior-Point Algorithm
GuSTO.jl
Guaranteed Sequential Trajectory Optimization (GuSTO), using sequential convex programming for trajectory optimization with strong theoretical guarantees
PIPAL
Penalty-Interior-Point Algorithm
Reduceron
FPGA Haskell machine with game changing performance. Reduceron is Matthew Naylor, Colin Runciman and Jason Reich's high performance FPGA softcore for running lazy functional programs, including hardware garbage collection. Reduceron has been implemented on various FPGAs with clock frequency ranging from 60 to 150 MHz depending on the FPGA. A high degree of parallelism allows Reduceron to implement graph evaluation very efficiently. This fork aims to continue development on this, with a view to practical applications. Comments, questions, etc are welcome.
SCvx
Implementation of the Successive Convexification algorithm.
itsmathtime's Repositories
itsmathtime/GuSTO.jl
Guaranteed Sequential Trajectory Optimization (GuSTO), using sequential convex programming for trajectory optimization with strong theoretical guarantees
itsmathtime/PIPAL
Penalty-Interior-Point Algorithm
itsmathtime/Reduceron
FPGA Haskell machine with game changing performance. Reduceron is Matthew Naylor, Colin Runciman and Jason Reich's high performance FPGA softcore for running lazy functional programs, including hardware garbage collection. Reduceron has been implemented on various FPGAs with clock frequency ranging from 60 to 150 MHz depending on the FPGA. A high degree of parallelism allows Reduceron to implement graph evaluation very efficiently. This fork aims to continue development on this, with a view to practical applications. Comments, questions, etc are welcome.
itsmathtime/SCvx
Implementation of the Successive Convexification algorithm.