Computing B-Stationary Points of Nonsmooth DC Programs

Motivated by a class of applied problems arising from physical layer based security in a digital communication system, in particular, by a secrecy sum-rate maximization problem, this paper studies a nonsmooth, difference-of-convex (dc) minimization problem. The contributions of this paper are (i) clarify several kinds of stationary solutions and their relations; (ii) develop and establish the convergence of a novel algorithm for computing a d-stationary solution of a problem with a convex feasible set that is arguably the sharpest kind among the various stationary solutions; (iii) extend the algorithm in several directions including a randomized choice of the subproblems that could help the practical convergence of the algorithm, a distributed penalty approach for problems whose objective functions are sums of dc functions, and problems with a specially structured (nonconvex) dc constraint. For the latter class of problems, a pointwise Slater constraint qualification is introduced that facilitates the verification and computation of a B(ouligand)-stationary point.

[1]  Zhi-Quan Luo,et al.  Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks , 2014, IEEE Transactions on Signal Processing.

[2]  Le Thi Hoai An,et al.  On solving Linear Complementarity Problems by DC programming and DCA , 2011, Comput. Optim. Appl..

[3]  Shiqian Ma,et al.  A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization , 2014, Math. Oper. Res..

[4]  Jong-Shi Pang,et al.  Nonconvex Games with Side Constraints , 2011, SIAM J. Optim..

[5]  Francisco Facchinei,et al.  An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions , 2013, Mathematical Programming.

[6]  Tao Pham Dinh,et al.  Exact penalty in d.c. programming , 1999 .

[7]  Le Thi Hoai An,et al.  DC Programming and DCA for General DC Programs , 2014, ICCSAMA.

[8]  Stefan Scholtes,et al.  Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity , 2000, Math. Oper. Res..

[9]  Francisco Facchinei,et al.  Flexible parallel algorithms for big data optimization , 2013, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[10]  Paul-Emile Maingé,et al.  Convergence of New Inertial Proximal Methods for DC Programming , 2008, SIAM J. Optim..

[11]  Francisco Facchinei,et al.  Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems , 2013, IEEE Transactions on Signal Processing.

[12]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[13]  Zhi-Quan Luo,et al.  A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization , 2012, SIAM J. Optim..

[14]  Stefan Scholtes,et al.  Nonconvex Structures in Nonlinear Programming , 2004, Oper. Res..

[15]  J. S. Pang.  Partially B-Regular Optimization and Equilibrium Problems , 2007, Math. Oper. Res..

[16]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[17]  J. Kruskal.  Two convex counterexamples: A discontinuous envelope function and a nondifferentiable nearest-point mapping , 1969 .

[18]  Francisco Facchinei,et al.  Parallel and distributed methods for nonconvex optimization , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[19]  John E. Mitchell,et al.  On conic QPCCs, conic QCQPs and completely positive programs , 2015, Mathematical Programming.

[20]  Meisam Razaviyayn,et al.  Successive Convex Approximation: Analysis and Applications , 2014 .

[21]  Abdellatif Moudafi,et al.  On the difference of two maximal monotone operators: Regularization and algorithmic approaches , 2008, Appl. Math. Comput..

[22]  S Scholtes,et al.  Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity , 1997 .

[23]  Masao Fukushima,et al.  Complementarity Constraint Qualifications and Simplified B-Stationarity Conditions for Mathematical Programs with Equilibrium Constraints , 1999, Comput. Optim. Appl..

[24]  John E. Mitchell,et al.  On QPCCs , QCQPs and Completely Positive Programs , 2014 .

[25]  Gert R. G. Lanckriet,et al.  A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory , 2012, Neural Computation.

[26]  Daniel Ralph,et al.  QPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints , 1999, Comput. Optim. Appl..

[27]  T. P. Dinh,et al.  Convex analysis approach to d.c. programming: Theory, Algorithm and Applications , 1997 .

[28]  H. Tuy.  Global Minimization of a Difference of Two Convex Functions , 1987 .

[29]  Le Thi Hoai An,et al.  Exact penalty and error bounds in DC programming , 2012, J. Glob. Optim..

[30]  Paul Tseng,et al.  On almost smooth functions and piecewise smooth functions , 2007 .

[31]  Eduard A. Jorswieck,et al.  Secrecy on the Physical Layer in Wireless Networks , 2010 .

[32]  Marc Teboulle,et al.  Proximal alternating linearized minimization for nonconvex and nonsmooth problems , 2013, Mathematical Programming.

[33]  Moudafi,et al.  ON THE CONVERGENCE OF AN APPROXIMATE PROXIMAL METHOD FOR DC FUNCTIONS , 2006 .

[34]  Benar Fux Svaiter,et al.  Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods , 2013, Math. Program..

[35]  J. Hiriart-Urruty.  Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions , 1985 .

[36]  Le Thi Hoai An,et al.  DC programming in communication systems: challenging problems and methods , 2014, Vietnam Journal of Computer Science.

[37]  Zhi-Quan Luo,et al.  Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization , 2014, NIPS.

[38]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[39]  R. Horst,et al.  DC Programming: Overview , 1999 .

[40]  Jong-Shi Pang,et al.  A New Decomposition Method for Multiuser DC-Programming and Its Applications , 2014, IEEE Transactions on Signal Processing.

[41]  Jonathan M. Borwein,et al.  On difference convexity of locally Lipschitz functions , 2011 .

[42]  Alberth Estuardo Alvarado-Ortiz.  Centralized and distributed resource allocation with applications to signal processing in communications , 2014 .

[43]  A. Shapiro.  Directionally nondifferentiable metric projection , 1994 .

[44]  Jong-Shi Pang,et al.  A unified distributed algorithm for non-cooperative games , 2016, Big Data over Networks.

[45]  Le Thi Hoai An,et al.  Recent Advances in DC Programming and DCA , 2013, Trans. Comput. Collect. Intell..

[46]  John E. Mitchell,et al.  On convex quadratic programs with linear complementarity constraints , 2013, Comput. Optim. Appl..