A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems

References

• Burton W, Toint P. On an instance of the inverse shortest paths problem. Math Program. 1992;53:45–61. doi: 10.1007/BF01585693
   Web of Science ®Google Scholar
• Cai M, Yang X, Zhang J. The complexity analysis of the inverse center location problem. J Global Optim. 1999;15:213–218. doi: 10.1023/A:1008360312607
   Web of Science ®Google Scholar
• Zhang J, Ma Z. Solution structure of some inverse combinatorial optimization problems. J Comb Optim. 1999;3:127–139. doi: 10.1023/A:1009829525096
   Web of Science ®Google Scholar
• Zhang J, Liu Z, Ma Z. Some reverse location problems. Eur J Oper Res. 2000;124:77–88. doi: 10.1016/S0377-2217(99)00122-8
   Web of Science ®Google Scholar
• Ahuja R, Orlin J. Inverse optimization. Oper Res. 2001;49:771–783. doi: 10.1287/opre.49.5.771.10607
   Web of Science ®Google Scholar
• Ahuja R, Orlin J. Combinatorial algorithms for inverse network flow problems. Networks. 2002;40:181–187. doi: 10.1002/net.10048
   Web of Science ®Google Scholar
• Heuberger C. Inverse combinatorial optimization: a survey on problems, methods and results. J Comb Optim. 2004;8:329–361. doi: 10.1023/B:JOCO.0000038914.26975.9b
   Web of Science ®Google Scholar
• Zhang J, Liu Z. Calculating some inverse linear programming problems. J Comput Appl Math. 1996;72:261–273. doi: 10.1016/0377-0427(95)00277-4
   Web of Science ®Google Scholar
• Zhang J, Liu Z. A further study on inverse linear programming problems. J Comput Appl Math. 1999;106:345–359. doi: 10.1016/S0377-0427(99)00080-1
   Web of Science ®Google Scholar
• Iyengar G, Kang W. Inverse conic programming and applications. Oper Res Lett. 2005;33:319–330. doi: 10.1016/j.orl.2004.04.007
   Web of Science ®Google Scholar
• Zhang J, Zhang L. An augmented Lagrangian method for a class of inverse quadratic programming problems. Appl Math Optim. 2010;61:57–83. doi: 10.1007/s00245-009-9075-z
   Web of Science ®Google Scholar
• Wu J, Zhang Y, Zhang L, et al. A sequential convex program approach to an inverse linear semidefinite programming problem. Asia-Pac J Oper Res. 2016;33:1–26.
   Web of Science ®Google Scholar
• Xiao X, Zhang L, Zhang J. A smoothing Newton method for a type of inverse semidefinite quadratic programming problem. J Comput Appl Math. 2009;223:485–498. doi: 10.1016/j.cam.2008.01.028
   Web of Science ®Google Scholar
• Xiao X, Zhang L, Zhang J. On convergence of augmented Lagrange method for inverse semidefinite quadratic programming problems. J Ind Manag Optim. 2009;5:319–339. doi: 10.3934/jimo.2009.5.319
   Web of Science ®Google Scholar
• Lu Y, Ge Y, Zhang L. An alternating direction method for solving a class of inverse semidefinite quadratic programming problems. J Ind Manag Optim. 2016;12:317–336.
   Google Scholar
• Łojasiewicz S. Une propriété topologique des sous-ensembles analytiques réels. In: Les Équations aux Dérivées Partielles. Paris: Éditions du centre National de la Recherche Scientifique; 1963; p. 87–89.
   Google Scholar
• Łojasiewicz S. Sur la géométrie semi- et sous-analytique. Annales de L' Institut Fourier. 1993;43:1575–1595. doi: 10.5802/aif.1384
   Google Scholar
• Absil P, Mahony R, Andrews B. Convergence of the iterates of descent methods for analytic cost functions. SIAM J Optim. 2005;16:531–547. doi: 10.1137/040605266
   Web of Science ®Google Scholar
• Attouch H, Bolte J. On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math Program. 2009;116:5–16. doi: 10.1007/s10107-007-0133-5
   Web of Science ®Google Scholar
• Attouch H, Bolte J, Redont P, et al. Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-Łojasiewicz inequality. Math Oper Res. 2010;35:438–457. doi: 10.1287/moor.1100.0449
   Web of Science ®Google Scholar
• Bolte J, Sabach S, Teboulle M. Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math Program. 2014;146:459–494. doi: 10.1007/s10107-013-0701-9
   Web of Science ®Google Scholar
• Attouch H, Bolte J, Svaiter B. Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math Program. 2013;137:91–129. doi: 10.1007/s10107-011-0484-9
   Web of Science ®Google Scholar
• Li G, Pong T. Global convergence of splitting methods for nonconvex composite optimization. SIAM J Optim. 2015;25:2434–2460. doi: 10.1137/140998135
   Web of Science ®Google Scholar
• Hong M, Luo Z, Razaviyayn M. Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J Optim. 2016;26:337–364. doi: 10.1137/140990309
   Web of Science ®Google Scholar
• Guo K, Han D, Wu T. Convergence of alterning direction method for minimizing sum of two nonconvex functions with linear constraints. Int J Comput Math. 2016;94:1653–1669. doi: 10.1080/00207160.2016.1227432
   Web of Science ®Google Scholar
• Yang L, Pong T, Chen X. Alternating direction method of multiplier for a class of nonconvex and nonsmooth problems with applications to background/foregound extraction, SIAM J. Imaging Sci. 2017;10:74–110.
   Google Scholar
• Nesterov Y. Introductory lectures on convex optimization: a basic course. Berlin: Springer; 2004.
   Google Scholar
• Rockafellar R, Wets R. Variational analysis. New York: Springer; 1998.
   Google Scholar
• Li M, Sun D, Toh K. A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization. SIAM J Optim. 2016;26:922–950. doi: 10.1137/140999025
   Web of Science ®Google Scholar
• Xu Z, Chang X, Xu F, et al. L1/2 regularization: a thresholding representation theory and a fast solver. IEEE Trans Neural Netw Learn Syst. 2012;23:1013–1027. doi: 10.1109/TNNLS.2012.2197412
   PubMed Web of Science ®Google Scholar
• Cao W, Sun J, Xu Z. Fast image deconvolution using closed-form thresholding formulas of Lq (q=12,23) regularization, J. Vis Commun Image R. 2013;24:31–41. doi: 10.1016/j.jvcir.2012.10.006
   Web of Science ®Google Scholar
• Lu Z. Iterative reweighted minimization methods for lp regularized unconstrained nonlinear programming. Math Program. 2014;147:277–307. doi: 10.1007/s10107-013-0722-4
   Web of Science ®Google Scholar