<--- Back to Details
First PageDocument Content
Linear programming / Mathematical analysis / Duality / Decomposition method / Augmented Lagrangian method / Lagrange multiplier / Mathematical optimization / Operations research / Convex optimization
Date: 2011-06-24 05:46:03
Linear programming
Mathematical analysis
Duality
Decomposition method
Augmented Lagrangian method
Lagrange multiplier
Mathematical optimization
Operations research
Convex optimization

Alternating Direction Method of Multipliers

Add to Reading List

Source URL: stanford.edu

Download Document from Source Website

File Size: 384,84 KB

Share Document on Facebook

Similar Documents

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

DocID: 1xVFF - View Document

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

Mathematics / Mathematical optimization / Computational complexity theory / Combinatorial optimization / Travelling salesman problem / Cutting-plane method / Decomposition method / Linear programming / COIN-OR / Ear decomposition

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher

DocID: 1vcNT - View Document