Dual Decomposition with Many Overlapping Components Andr´e F. T. Martins∗† Noah A. Smith∗ Pedro M. Q. Aguiar‡ M´ario A. T. Figueiredo† ∗ School of Computer Science, Carnegie Mellon University, Pittsburgh, P

First Page		Document Content
Date: 2011-06-21 07:04:38 Mathematical optimization Operations research Mathematics Mathematical analysis Convex optimization Subgradient method Augmented Lagrangian method Decomposition method Dynamic programming Algorithm Linear programming		Dual Decomposition with Many Overlapping Components Andr´e F. T. Martins∗† Noah A. Smith∗ Pedro M. Q. Aguiar‡ M´ario A. T. Figueiredo† ∗ School of Computer Science, Carnegie Mellon University, Pittsburgh, P Add to Reading List Source URL: users.isr.ist.utl.pt Download Document from Source Website File Size: 465,76 KB Share Document on Facebook

	Journal of Machine Learning Research2159 Submitted 3/10; Revised 3/11; Published 7/11 Adaptive Subgradient Methods for Online Learning and Stochastic Optimization∗ DocID: 1qKC1 - View Document
	Dual Decomposition with Many Overlapping Components Andr´e F. T. Martins∗† Noah A. Smith∗ Pedro M. Q. Aguiar‡ M´ario A. T. Figueiredo† ∗ School of Computer Science, Carnegie Mellon University, Pittsburgh, P DocID: 1q5aD - View Document
	Projected Natural Actor-Critic Philip S. Thomas, William Dabney, Sridhar Mahadevan, and Stephen Giguere School of Computer Science University of Massachusetts Amherst Amherst, MA 01003 DocID: 1q440 - View Document
	HVX: Disciplined Convex Programming and Symbolic Subdifferentiation in Haskell Chris Copeland 1 DocID: 1pqhm - View Document
	Journal of Machine Learning Research) ??-?? Submitted; Revised; PublishedEfficient Online and Batch Learning using Forward Backward Splitting DocID: 1pimU - View Document