{"product_id":"9781680831368","title":"Low-Rank Semidefinite Programming: Theory and Applications","description":"\u003cp\u003eFinding low-rank solutions of semidefinite programs is important in many applications. For example, semidefinite programs that arise as relaxations of polynomial optimization problems are exact relaxations when the semidefinite program has a rank-1 solution. Unfortunately, computing a minimum-rank solution of a semidefinite program is an NP-hard problem. This monograph reviews the theory of low-rank semidefinite programming, presenting theorems that guarantee the existence of a low-rank solution, heuristics for computing low-rank solutions, and algorithms for finding low-rank approximate solutions. It then presents applications of the theory to trust-region problems and signal processing.\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e","brand":"Now Publishers","offers":[{"title":"Default Title","offer_id":47051630215408,"sku":"9781680831368","price":99.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9781680831368_p0.jpg?v=1763690285","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9781680831368","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}