"Sparse semidefinite programs with guaranteed near-linear time complexity ..."

Richard Y. Zhang, Javad Lavaei (2021)

> Home

Details and statistics

DOI: 10.1007/S10107-020-01516-Y

access: closed

type: Journal Article

metadata version: 2021-07-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/ZhangL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/ZhangL21
Richard Y. Zhang, Javad Lavaei:
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. Math. Program. 188(1): 351-393 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.