Penalty and Augmented Lagrangian Methods for Constrained DC Programming

References

• [1] Ahn M, Pang J-S, Xin J (2017) Difference-of-convex learning: Directional stationarity, optimality, and sparsity. SIAM J. Optim. 27(3):1637–1665.Crossref, Google Scholar
• [2] Alvarado A (2014) Centralized and distributed resource allocation with applications to signal processing in communications. Unpublished Ph.D. thesis, University of Illinois at Urbana-Champaign.Google Scholar
• [3] Aubin JP, Frankowska H (2009) Set-Valued Analysis (Springer, Boston).Crossref, Google Scholar
• [4] Beck A, Hallak N (2020) On the convergence to stationary points of deterministic and randomized feasible descent directions methods. SIAM J. Optim. 30(1):56–79.Crossref, Google Scholar
• [5] Beck A, Teboulle M (2003) Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3):167–175.Crossref, Google Scholar
• [6] Bertsekas DP (1999) Nonlinear Programming, 2nd ed. (Athena Scientific, Belmont, MA).Google Scholar
• [7] Cui Y, Pang J-S, Sen B (2018) Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28(4):3344–3374.Crossref, Google Scholar
• [8] Dong H, Ahn M, Pang J-S (2019) Structural properties of affine sparsity constraints. Math. Programming 176(1–2):95–135.Crossref, Google Scholar
• [9] Gasso G, Rakotomamonjy A, Canu S (2009) Recovering sparse signals with a certain family of non-convex penalties and DC programming. IEEE Trans. Image Processing 57(12):4686–4698.Crossref, Google Scholar
• [10] Hong LJ, Yang Y, Zhang L (2011) Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach. Oper. Res. 59(3):617–630.Link, Google Scholar
• [11] Hong M, Razaviyayn M, Luo Z-Q, Pang J-S (2016) A unified algorithmic framework for block-structured optimization involving big data: With applications in machine learning and signal processing. IEEE Signal Processing Magazine 33(1):57–77.Crossref, Google Scholar
• [12] Le Thi HA, Pham DT (2018) DC programming and DCA: Thirty years of developments. Math. Programming 169(1):5–68.Crossref, Google Scholar
• [13] Le Thi HA, Huynh VN, Pham DT (2014) DC programming and DCA for general DC programs. Do TV, Le Thi HA, Nguyen NT, eds. Advanced Computational Methods for Knowledge Engineering (Springer, Cham, Switzerland), 15–35.Crossref, Google Scholar
• [14] Li DH, Wu L, Sun Z, Zhang XJ (2014) A constrained optimization reformulation and a feasible descent direction method for L1/2 regularization. Comput. Optim. Appl. 59(1–2):263–284.Crossref, Google Scholar
• [15] Liu T, Pong TK, Takeda A (2019) A refined convergence analysis of pDCAe with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. 73(1):69–100.Crossref, Google Scholar
• [16] Liu T, Pong TK, Takeda A (2019) A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Programming 176(1–2):339–367.Crossref, Google Scholar
• [17] Lu Z (2012) Sequential convex programming methods for a class of structured nonlinear programming. Preprint, submitted October 10, https://arxiv.org/abs/1210.3039.Google Scholar
• [18] Lu Z, Li X (2018) Sparse recovery via partial regularization: Models, theory, and algorithms. Math. Oper. Res. 43(4):1290–1316.Link, Google Scholar
• [19] Lu Z, Zhang Y (2012) An augmented Lagrangian approach for sparse principal component analysis. Math. Programming 135(1–2):149–193.Crossref, Google Scholar
• [20] Lu Z, Zhou Z, Sun Z (2019) Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Programming 176(1–2):369–401.Crossref, Google Scholar
• [21] Nemirovski A, Yudin D (1983) Problem Complexity and Method Efficiency in Optimization (Wiley, New York).Google Scholar
• [22] Nesterov Y (2005) Smooth minimization of non-smooth functions. Math. Programming 103(1):127–152.Crossref, Google Scholar
• [23] Nocedal J, Wright SJ (2006) Numerical Optimization, 2nd ed. (Springer, New York).Google Scholar
• [24] Pang J-S (2007) Partially B-regular optimization and equilibrium problems. Math. Oper. Res. 32(3):687–699.Link, Google Scholar
• [25] Pang J-S, Razaviyayn M, Alvarado A (2017) Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1):95–118.Link, Google Scholar
• [26] Raydan M (1997) The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7(1):26–33.Crossref, Google Scholar
• [27] Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [28] Wen B, Chen X, Pong TK (2018) A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2):297–324.Crossref, Google Scholar
• [29] Zheng X, Sun X, Li D, Sun J (2014) Successive convex approximations to cardinality-constrained convex programs: A piecewise-linear DC approach. Comput. Optim. Appl. 59(1–2):379–397.Crossref, Google Scholar