Kamil Khan (kamilkhanlab)

kamilkhanlab

Geek Repo

Location:McMaster University, Hamilton, ON, Canada

Home Page:https://www.khanresearchgroup.com

Github PK Tool:Github PK Tool

Kamil Khan's repositories

nonogram-ilp

ILP formulation in GAMS for solving nonograms

Language:GAMSLicense:MITStargazers:4Issues:1Issues:0

ConvexSampling.jl

Constructs linear underestimators of convex functions by tractable black-box sampling. Implemented in Julia.

Language:JuliaLicense:MITStargazers:3Issues:1Issues:0

continuous-convex-adjoints

A Julia/C++ implementation and numerical examples of adjoint subgradient evaluation for convex ODE relaxations, as described by Zhang and Khan (2024).

Language:JuliaLicense:MITStargazers:2Issues:0Issues:0

convex-ode-subgradients

Contains code for the numerical examples in an article by Yingkai Song and Kamil Khan. This code evaluates subgradients for convex relaxations of parametric ordinary differential equations (ODEs)

Language:JuliaLicense:MITStargazers:2Issues:1Issues:0

nonsmooth-forward-ad

Implementation of the vector forward mode of automatic differentiation (AD) for generalized differentiation of nonsmooth functions. Uses operator overloading in Julia.

Language:JuliaLicense:MITStargazers:2Issues:1Issues:0

ob-ode-relaxations

Proof-of-concept implementation of a method by Song and Khan (2022) for computing convex relaxations for parametric ordinary differential equations.

Language:MATLABLicense:MITStargazers:1Issues:1Issues:0

computational-graph-tools

Tools in Julia for automatically constructing the computational graph/tape of a composite function, and performing the reverse AD mode.

Language:JuliaLicense:MITStargazers:0Issues:1Issues:0

implicit-func-relaxations

Proof-of-concept implementation of a new method for computing convex relaxations for implicit functions and inverse functions.

License:MITStargazers:0Issues:1Issues:0
Language:HTMLStargazers:0Issues:0Issues:0

NonogramSolver.jl

Formulates and solves nonogram puzzles (a.k.a. Picross and paint-by-number) in Julia. Uses a new integer linear programming formulation, and solves it with JuMP.

Language:JuliaLicense:MITStargazers:0Issues:1Issues:1