{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T01:20:52Z","timestamp":1704331252448},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T00:00:00Z","timestamp":1587254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T00:00:00Z","timestamp":1587254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0, 2016\/01860-1, and 2018\/24293-0"],"award-info":[{"award-number":["2013\/07375-0, 2016\/01860-1, and 2018\/24293-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["438185\/2018-8, 302538\/2019-4, and 302682\/2019-8"],"award-info":[{"award-number":["438185\/2018-8, 302538\/2019-4, and 302682\/2019-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11075-020-00928-3","type":"journal-article","created":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T10:02:35Z","timestamp":1587290555000},"page":"1165-1188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On constrained optimization with nonconvex regularization"],"prefix":"10.1007","volume":"86","author":[{"given":"E. G.","family":"Birgin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,19]]},"reference":[{"key":"928_CR1","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/060654797","volume":"18","author":"R Andreani","year":"2008","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, M.J., Schuverdt, M.L.: On augmented Lagrangian methods with general lower-level constraints. SIAM J. Optim. 18, 1286\u20131309 (2008)","journal-title":"SIAM J. Optim."},{"key":"928_CR2","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/02331930903578700","volume":"60","author":"R Andreani","year":"2011","unstructured":"Andreani, R., Haeser, G., Mart\u00ednez, M.J.: On sequential optimality conditions for smooth constrained optimization. Optimization 60, 627\u2013641 (2011)","journal-title":"Optimization"},{"key":"928_CR3","unstructured":"Bertsekas, D.P.: Nonlinear programming, Athenas Scientific (1999)"},{"key":"928_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"W Bian","year":"2009","unstructured":"Bian, W., Chen, X.: From sparse solutions of systems of equations to sparse modeling of signals and image. SIAM Rev. 51, 34\u201381 (2009)","journal-title":"SIAM Rev."},{"key":"928_CR5","doi-asserted-by":"publisher","first-page":"2294","DOI":"10.1137\/140985639","volume":"8","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X.: Linearly constrained non Lipschitz optimization for image restoration. SIAM J. Imaging Sci. 8, 2294\u20132322 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"928_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. 149, 301\u2013327 (2015)","journal-title":"Math. Program."},{"key":"928_CR7","doi-asserted-by":"crossref","unstructured":"Birgin, E.G., Mart\u00ednez, M.J.: Practical augmented Lagrangian methods for constrained optimization society for industrial and applied mathematics, Philadelphia (2014)","DOI":"10.1137\/1.9781611973365"},{"key":"928_CR8","doi-asserted-by":"publisher","unstructured":"Birgin E.G., Mart\u00ednez, M.J.: Complexity and performance of an augmented Lagrangian algorithm, Optimization Methods and Software, to appear. https:\/\/doi.org\/10.1080\/10556788.2020.1746962","DOI":"10.1080\/10556788.2020.1746962"},{"key":"928_CR9","doi-asserted-by":"publisher","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, M.J., Santos, S.A.: On the use of third-order models with fourth-order regularization for unconstrained optimization, Optimization Letters, to appear. https:\/\/doi.org\/10.1007\/s11590-019-01395-z","DOI":"10.1007\/s11590-019-01395-z"},{"key":"928_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, M.J., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using higher order regularized models. Math. Progr. 163, 359\u2013368 (2017)","journal-title":"Math. Progr."},{"key":"928_CR11","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1137\/17M1127107","volume":"28","author":"EG Birgin","year":"2018","unstructured":"Birgin, E.G., Mart\u00ednez, M.J.: On regularization and active-set methods with complexity for constrained optimization. SIAM J. Optim. 28, 1367\u20131395 (2018)","journal-title":"SIAM J. Optim."},{"key":"928_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.3905\/jpm.1999.319754","volume":"25","author":"S Browne","year":"1999","unstructured":"Browne, S.: The risk and rewards of minimizing shortfall probability. J. Portf. Manag. 25, 76\u201385 (1999)","journal-title":"J. Portf. Manag."},{"key":"928_CR13","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"E Candes","year":"2008","unstructured":"Candes, E., Wakin, M., Boyd, S.: Enhancing sparsity by reweighted L1 minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"928_CR14","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s10208-017-9363-y","volume":"18","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.h.L.: Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization. Found. Comput. Math. 18, 1073\u20131107 (2018)","journal-title":"Found. Comput. Math."},{"key":"928_CR15","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/15M1052834","volume":"55","author":"X Chen","year":"2017","unstructured":"Chen, X., Guo, L., Lu, Z., Ye, J.: An augmented Lagrangian method for non-Lipschitz nonconvex programming. SIAM J. Numer. Anal. 55, 168\u2013193 (2017)","journal-title":"SIAM J. Numer. Anal."},{"key":"928_CR16","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1137\/120871390","volume":"23","author":"X Chen","year":"2013","unstructured":"Chen, X., Niu, L., Yuan, Y.: Optimality conditions and a smoothing trust region Newton method for non-Lipschitz optimization. SIAM J. Optim. 23, 1528\u20131552 (2013)","journal-title":"SIAM J. Optim."},{"key":"928_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-013-9553-8","volume":"59","author":"X Chen","year":"2014","unstructured":"Chen, X., Zhou, W.: Convergence of the reweighted L1 minimization algorithm for L2-Lp minimization. Comput. Optim. Appl. 59, 47\u201361 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"928_CR18","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support vector networks. Mach. Learn. 20, 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"928_CR19","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"928_CR20","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1214\/009053604000000256","volume":"32","author":"J Fang","year":"2004","unstructured":"Fang, J., Peng, H.: Nonconcave penalized likelihood with a diverging number of parameters. Ann. Stat. 32, 928\u2013961 (2004)","journal-title":"Ann. Stat."},{"key":"928_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1080\/00401706.1993.10485033","volume":"35","author":"LE Frank","year":"1993","unstructured":"Frank, L.E., Friedman, J.H.: A statistical view of some chemometrics regression tools. Technometrics 35, 109\u2013135 (1993)","journal-title":"Technometrics"},{"key":"928_CR22","doi-asserted-by":"publisher","unstructured":"Haeser, G., Liu, H., Ye, Y.: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Mathematical Programming, to appear. https:\/\/doi.org\/10.1007\/s10107-018-1290-4","DOI":"10.1007\/s10107-018-1290-4"},{"key":"928_CR23","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"M Lai","year":"2010","unstructured":"Lai, M., Wang, J.: An unconstrained Lq minimization with 0 < q \u2264\u20091 for sparse solution of underdetermined linear systems. SIAM J. Optim. 21, 82\u2013101 (2010)","journal-title":"SIAM J. Optim."},{"key":"928_CR24","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10107-015-0939-5","volume":"158","author":"YF Liu","year":"2016","unstructured":"Liu, Y.F., Ma, S., Dai, Y.H., Zhang, S.: A smoothing SQP framework for a class of composite Lq minimization over polyhedron. Math. Program. 158, 467\u2013500 (2016)","journal-title":"Math. Program."},{"key":"928_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-013-0722-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative reweighted minimization methods for Lp regularized unconstrained nonlinear programming. Math. Program. 147, 277\u2013307 (2014)","journal-title":"Math. Program."},{"key":"928_CR26","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1137\/17M1115472","volume":"27","author":"MJ Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, M.J.: On high-order model regularization for constrained optimization. SIAM J. Optim. 27, 2447\u20132458 (2017)","journal-title":"SIAM J. Optim."},{"key":"928_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K. E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"928_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/070692285","volume":"1","author":"M Nikolova","year":"2008","unstructured":"Nikolova, M., Ng, M.K., Zhang, S., Ching, W.K.: Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization. SIAM J. Imaging Sci. 1, 2\u201325 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"928_CR29","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer-Verlag, New York (2006)"},{"key":"928_CR30","doi-asserted-by":"crossref","unstructured":"Vogel, C.R.: Computational methods for inverse problems, Society for industrial and applied mathematics, Philadelphia (2002)","DOI":"10.1137\/1.9780898717570"},{"key":"928_CR31","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax nonconcave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00928-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00928-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00928-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T23:57:10Z","timestamp":1618790230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00928-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,19]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["928"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00928-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,19]]},"assertion":[{"value":"16 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}