bv_cvxbook_extra_exercises

# Nonnegativity of the weights implies l 0 denote the

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: s a special case in which the edges contain no more than two nodes. We consider a hypergraph with m nodes and assume coordinate vectors xj ∈ Rp , j = 1, . . . , m, are associated with the nodes. Some nodes are ﬁxed and their coordinate vectors xj are given. The other nodes are free, and their coordinate vectors will be the optimization variables in the problem. The objective is to place the free nodes in such a way that some measure of the physical size of the nets is small. As an example application, we can think of the nodes as modules in an integrated circuit, placed at positions xj ∈ R2 . Every edge is an interconnect network that carries a signal from one module to one or more other modules. To deﬁne a measure of the size of a net, we store the vectors xj as columns of a matrix X ∈ Rp×m . For each edge S in the hypergraph, we use XS to denote the p × |S | submatrix of X with the columns associated with the nodes of S . We deﬁne fS (X ) = inf XS − y 1T . (41) y as the size...
View Full Document

## This note was uploaded on 09/10/2013 for the course C 231 taught by Professor F.borrelli during the Fall '13 term at Berkeley.

Ask a homework question - tutors are online