{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:19Z","timestamp":1750221019109,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":20,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3335484.3335510","type":"proceedings-article","created":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T16:54:49Z","timestamp":1562604889000},"page":"281-286","source":"Crossref","is-referenced-by-count":0,"title":["Accelerated Proximal Gradient Method with Line Search for Large-Scale Nonconvex Penalty Problems"],"prefix":"10.1145","author":[{"given":"Zhongming","family":"Wu","sequence":"first","affiliation":[{"name":"School of Economics and Management, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Science, Nanjing University of Science and Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhangjin","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3335484.3335510-1","doi-asserted-by":"crossref","unstructured":"Fan J., and Li R. 2001. Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348--1360. DOI= https:\/\/doi.org\/10.1198\/016214501753382273.","DOI":"10.1198\/016214501753382273"},{"key":"key-10.1145\/3335484.3335510-2","unstructured":"Zhang C. H. 2010. Nearly unbiased variable selection under minimax concave penalty. The Ann. Stat. 38, 894--942. DOI= https:\/\/projecteuclid.org\/euclid.aos\/1266586618."},{"key":"key-10.1145\/3335484.3335510-3","doi-asserted-by":"crossref","unstructured":"Jain P., and Kar P. 2017. Non-convex optimization for machine learning. Found. Trends Mach. Learn. 10, 142--336. DOI= http:\/\/dx.doi.org\/10.1561\/2200000058.","DOI":"10.1561\/2200000058"},{"key":"key-10.1145\/3335484.3335510-4","doi-asserted-by":"crossref","unstructured":"Sra S., Nowozin S., and Wright S. J. 2012. Optimization for Machine Learning. MIT Press.","DOI":"10.7551\/mitpress\/8996.001.0001"},{"key":"key-10.1145\/3335484.3335510-5","doi-asserted-by":"crossref","unstructured":"Yin W., Osher S., Goldfarb D., and Darbon J. 2008. Bregman iterative algorithms for l1-minimization with applications to compressed sensing. SIAM J. Imaging Sci., 1, 143--168. DOI= https:\/\/doi.org\/10.1137\/070703983.","DOI":"10.1137\/070703983"},{"key":"key-10.1145\/3335484.3335510-6","unstructured":"Kwok J. T., Wang T. F., and Liu T. Y. 2018. Large-scale low-rank matrix learning with nonconvex regularizers. IEEE T. Pattern Anal., in press. DOI= http:\/\/ieeexplore.ieee.org\/10.1109\/TPAMI.2018.2858249."},{"key":"key-10.1145\/3335484.3335510-7","unstructured":"Yuan G., and Ghanem B. 2019. l0 TV: A sparse optimization method for impulse noise image restoration. IEEE T. Pattern Anal. 41, 2, 352--364. DOI= http:\/\/ieeexplore.ieee.org\/10.1109\/TPAMI.2017.2783936."},{"key":"key-10.1145\/3335484.3335510-8","doi-asserted-by":"crossref","unstructured":"Cai J. F., Candès E. J., and Shen Z. 2010. A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956-1982. DOI= https:\/\/doi.org\/10.1137\/080738970.","DOI":"10.1137\/080738970"},{"key":"key-10.1145\/3335484.3335510-9","doi-asserted-by":"crossref","unstructured":"Cui Z. x., and Fan Q. 2017. A nonconvex nonsmooth regularization method for compressed sensing and low rank matrix completion. Digit. Signal Process. 62, 101--111. DOI= https:\/\/doi.org\/10.1016\/j.dsp.2016.11.006.","DOI":"10.1016\/j.dsp.2016.11.006"},{"key":"key-10.1145\/3335484.3335510-10","unstructured":"Yao Q., and Kwok J. T. 2018. Accelerated and inexact soft-impute for large-scale matrix and tensor completion. IEEE T. Knowl. Date En., in press. DOI= http:\/\/ieeexplore.ieee.org\/10.1109\/TKDE.2018.2867533."},{"key":"key-10.1145\/3335484.3335510-11","doi-asserted-by":"crossref","unstructured":"Beck A., and Teboulle M. 2009. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183--202. DOI= https:\/\/doi.org\/10.1137\/080716542.","DOI":"10.1137\/080716542"},{"key":"key-10.1145\/3335484.3335510-12","doi-asserted-by":"crossref","unstructured":"Johnstone P. R., and Moulin P. 2017. Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions. Comput. Optim. Appl. 67, 259--292. DOI= https:\/\/doi.org\/10.1007\/s10589-017-9896-7.","DOI":"10.1007\/s10589-017-9896-7"},{"key":"key-10.1145\/3335484.3335510-13","unstructured":"Li H., and Lin Z. 2015. Accelerated proximal gradient methods for nonconvex programming. In Adv. Neural Inf. Process. Syst., 379--387."},{"key":"key-10.1145\/3335484.3335510-14","doi-asserted-by":"crossref","unstructured":"Bolte J., Sabach S., and Teboulle M. 2014. Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459--494. DOI= https:\/\/doi.org\/10.1007\/s10107-013-0701-9.","DOI":"10.1007\/s10107-013-0701-9"},{"key":"key-10.1145\/3335484.3335510-15","doi-asserted-by":"crossref","unstructured":"Ochs P., Chen Y., Brox T., and Pock T. 2014. iPiano: Inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7, 1388--1419. DOI= https:\/\/doi.org\/10.1137\/130942954.","DOI":"10.1137\/130942954"},{"key":"key-10.1145\/3335484.3335510-16","doi-asserted-by":"crossref","unstructured":"Wen B., Chen X., and Pong T. K. 2017. Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27, 124--145. DOI= https:\/\/doi.org\/10.1137\/16M1055323.","DOI":"10.1137\/16M1055323"},{"key":"key-10.1145\/3335484.3335510-17","unstructured":"Yang L. 2018. Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems. Unpublished."},{"key":"key-10.1145\/3335484.3335510-18","unstructured":"Rockafellar R. 2015. Convex Analysis, Princeton University Press."},{"key":"key-10.1145\/3335484.3335510-19","doi-asserted-by":"crossref","unstructured":"Parikh N. and Boyd S. 2014. Proximal algorithms. Found. Trends Optim. 1, 127--239. DOI= http:\/\/dx.doi.org\/10.1561\/2400000003.","DOI":"10.1561\/2400000003"},{"key":"key-10.1145\/3335484.3335510-20","unstructured":"Lu C., Tang J., Yan S., and Lin Z. 2016. Nonconvex nonsmooth low rank minimization via iteratively reweighted nuclear norm. IEEE T. Image Process. 25, 829--839. DOI= http:\/\/ieeexplore.ieee.org\/10.1109\/TIP.2015.2511584."}],"event":{"number":"4","sponsor":["Shenzhen University","Sun Yat-Sen University"],"acronym":"ICBDC 2019","name":"the 2019 4th International Conference","start":{"date-parts":[[2019,5,10]]},"location":"Guangzhou, China","end":{"date-parts":[[2019,5,12]]}},"container-title":["Proceedings of the 2019 4th International Conference on Big Data and Computing  - ICBDC 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3335484.3335510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3335510&ftid=2070065&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:19Z","timestamp":1750206379000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3335484.3335510"}},"subtitle":[],"proceedings-subject":"Big Data and Computing","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1145\/3335484.3335510","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}