{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:42:20Z","timestamp":1730230940830,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,4,14]]},"DOI":"10.1109\/icassp48485.2024.10447398","type":"proceedings-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T18:56:31Z","timestamp":1710788191000},"page":"9631-9635","source":"Crossref","is-referenced-by-count":0,"title":["Cardinality-Constrained Binary Quadratic Optimization via Extreme Point Pursuit, with Application to the Densest K-Subgraph Problem"],"prefix":"10.1109","author":[{"given":"Ya","family":"Liu","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Electronic Engineering,Hong Kong,SAR of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junbin","family":"Liu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Electronic Engineering,Hong Kong,SAR of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Ma","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Electronic Engineering,Hong Kong,SAR of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/49.942507"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/78.992139"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3048232"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2008247"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2983642"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937280"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/16M105808X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.3.177.12637"},{"issue":"1","key":"ref9","first-page":"6446","article-title":"Community detection and stochastic block models: Recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1183"},{"volume-title":"Computers and intractability: A guide to the theory of NP-completeness","year":"1997","author":"Garey","key":"ref12"},{"key":"ref13","article-title":"On the densest k-subgraph problem","volume-title":"Tech. Rep.","author":"Feige","year":"1997"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-2015-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053974"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441756"},{"issue":"4","key":"ref18","first-page":"899","article-title":"Truncated power method for sparse eigenvalue problems","volume":"14","author":"Yuan","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2005.11732724"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO54536.2021.9616303"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747688"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2172\/395617"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2172\/876373"},{"key":"ref24","first-page":"1833","article-title":"On graduated optimization for stochastic non-convex problems","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Hazan"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_10"},{"volume-title":"Convex Analysis","year":"1997","author":"Rockafellar","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"article-title":"SNAP datasets: Stanford large network dataset collection","year":"2014","author":"Leskovec","key":"ref29"},{"key":"ref30","first-page":"1890","article-title":"Finding dense subgraphs via low-rank bilinear optimization","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Papailiopoulos"},{"volume-title":"Functional Analysis","year":"1991","author":"Rudin","key":"ref31"}],"event":{"name":"ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2024,4,14]]},"location":"Seoul, Korea, Republic of","end":{"date-parts":[[2024,4,19]]}},"container-title":["ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10445798\/10445803\/10447398.pdf?arnumber=10447398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T05:37:32Z","timestamp":1722577052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10447398\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/icassp48485.2024.10447398","relation":{},"subject":[],"published":{"date-parts":[[2024,4,14]]}}}