Sciweavers

11 search results - page 1 / 3
» Optimizing over Semimetric Polytopes
Sort
View
IPCO
2004
100views Optimization» more  IPCO 2004»
13 years 6 months ago
Optimizing over Semimetric Polytopes
Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi
MP
2010
163views more  MP 2010»
13 years 1 days ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
NIPS
2007
13 years 6 months ago
New Outer Bounds on the Marginal Polytope
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
David Sontag, Tommi Jaakkola
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
13 years 5 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
JMLR
2010
149views more  JMLR 2010»
13 years 2 days ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...