169,73 €
188,59 €
-10% with code: EXTRA
Low-Rank Semidefinite Programming
Low-Rank Semidefinite Programming
169,73
188,59 €
  • We will send in 10–14 business days.
Finding 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 solutio…
188.59
  • Publisher:
  • ISBN-10: 1680831364
  • ISBN-13: 9781680831368
  • Format: 15.6 x 23.4 x 1 cm, minkšti viršeliai
  • Language: English
  • SAVE -10% with code: EXTRA

Low-Rank Semidefinite Programming (e-book) (used book) | bookbook.eu

Reviews

Description

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

EXTRA 10 % discount with code: EXTRA

169,73
188,59 €
We will send in 10–14 business days.

The promotion ends in 22d.05:38:25

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,89 Book Euros!?
  • Author: Alex Lemon
  • Publisher:
  • ISBN-10: 1680831364
  • ISBN-13: 9781680831368
  • Format: 15.6 x 23.4 x 1 cm, minkšti viršeliai
  • Language: English English

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

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)