Example: biology
Introduction to Semidefinite Programming

Introduction to Semidefinite Programming

Back to document page

The dual problem of SDP is defined (or derived from first principles) to be: m SDD : maximize y ib i i=1 m s.t. y iA i + S = C i=1 S 0. One convenient way of thinking about this problem is as follows. Given mul­ tipliers y 1,...,y m, the objective is to maximize the linear function m i=1 y ib i.

  Principles

Download Introduction to Semidefinite Programming


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries