Scalable Semidefinite Relaxation for Maximum A Posterior Estimation

First Page		Document Content
Date: 2014-08-22 13:48:40 Mathematical optimization Operations research Mathematical analysis Linear programming Convex optimization Real algebraic geometry Semidefinite programming Relaxation Approximation algorithm Nonlinear programming Duality Quadratically constrained quadratic program		Scalable Semidefinite Relaxation for Maximum A Posterior Estimation Add to Reading List Source URL: geometry.stanford.edu Download Document from Source Website File Size: 187,49 KB Share Document on Facebook

	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
	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