Skip to content

Implements the alternating direction method of multipliers and it's faster variants in python to optimize a quadratic program

Notifications You must be signed in to change notification settings

raunaks13/convex-optimization-admm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

ADMM

This repository contains code that implements ADMM in Python 3 (alternating direction method of multipliers), AMA (alternating minimization algorithm), and their faster variants to optimize a linearly constrained quadratic program as outlined in the paper "Fast Alternating Direction Optimization Methods" (Goldstein et. al, 2014)

There is a report attached that contains several theoretical proofs, simulation results, and analysis of the algorithm by taking inspiration from the paper above. It also discusses other related ideas. This work was done as part of the course "Convex Optimization" at IIT Kanpur.

Goldstein, Tom, Brendan O'Donoghue, Simon Setzer, and Richard Baraniuk. 
"Fast alternating direction optimization methods." 
SIAM Journal on Imaging Sciences 7, no. 3 (2014): 1588-1623.

About

Implements the alternating direction method of multipliers and it's faster variants in python to optimize a quadratic program

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published