A Smoothing Penalty Function Algorithm for Two-Cardinality Sparse Constrained Optimization Problems

In this paper, a smoothing penalty function for two-cardinality sparse constrained optimization problems is presented. The paper proves that this type of the smoothing penalty functions has good properties in helping to solve two-cardinality sparse constrained optimization problems. Moreover, based on the penalty function, an algorithm is presented to solve the two-cardinality sparse constrained optimization problems, with its convergence under some conditions proved. A numerical experiment shows that a satisfactory approximate optimal solution can be obtained by the proposed algorithm.

[1]  Y. Ye,et al.  Lower Bound Theory of Nonzero Entries in Solutions of ℓ2-ℓp Minimization , 2010, SIAM J. Sci. Comput..

[2]  Tran Manh Thang,et al.  A New Smoothing Nonlinear Penalty Function for Constrained Optimization , 2017 .

[3]  Martin Branda,et al.  Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization , 2017, Comput. Optim. Appl..

[4]  W. Zangwill.  Non-Linear Programming Via Penalty Functions , 1967 .

[5]  Mustafa Ç. Pinar,et al.  On Smoothing Exact Penalty Functions for Convex Constrained Optimization , 1994, SIAM J. Optim..

[6]  Naihua Xiu,et al.  Gradient Support Projection Algorithm for Affine Feasibility Problem with Sparsity and Nonnegativity , 2014, 1406.7178.

[7]  Arkadi Nemirovski,et al.  On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization , 2008, Math. Program..

[8]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[9]  Ligang Liu,et al.  Surface approximation via sparse representation and parameterization optimization , 2016, Comput. Aided Des..

[10]  Duan Li,et al.  A polynomial case of the cardinality-constrained quadratic optimization problem , 2013, J. Glob. Optim..

[11]  Zongben Xu,et al.  An efficient optimization approach for a cardinality-constrained index tracking problem , 2015, Optim. Methods Softw..

[12]  Wotao Yin,et al.  Bregman Iterative Algorithms for (cid:2) 1 -Minimization with Applications to Compressed Sensing ∗ , 2008 .

[13]  Holger Rauhut,et al.  A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.

[14]  Xiaoqi Yang,et al.  Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems , 2003 .

[15]  S. Zenios,et al.  A smooth penalty function algorithm for network-structured problems , 1995 .

[16]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[17]  Yonina C. Eldar,et al.  Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms , 2012, SIAM J. Optim..

[18]  Akiko Takeda,et al.  DC formulations and algorithms for sparse optimization problems , 2017, Mathematical Programming.