IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v42y2017i4p1063-1084.html
   My bibliography  Save this article

Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization

Author

Listed:
  • Wei Bian

    (Department of Mathematics, Harbin Institute of Technology, Harbin, China 150001)

  • Xiaojun Chen

    (Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China)

Abstract

In this paper, we consider a class of constrained optimization problems where the feasible set is a general closed convex set, and the objective function has a nonsmooth, nonconvex regularizer. Such a regularizer includes widely used SCAD, MCP, logistic, fraction, hard thresholding, and non-Lipschitz L p penalties as special cases. Using the theory of the generalized directional derivative and the tangent cone, we derive a first order necessary optimality condition for local minimizers of the problem, and define the generalized stationary point of it. We show that the generalized stationary point is the Clarke stationary point when the objective function is Lipschitz continuous at this point, and satisfies the existing necessary optimality conditions when the objective function is not Lipschitz continuous at this point. Moreover, we prove the consistency between the generalized directional derivative and the limit of the classic directional derivatives associated with the smoothing function. Finally, we establish a lower bound property for every local minimizer and show that finding a global minimizer is strongly NP-hard when the objective function has a concave regularizer.

Suggested Citation

  • Wei Bian & Xiaojun Chen, 2017. "Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1063-1084, November.
    • Handle: RePEc:inm:ormoor:v:42:y:2017:i:4:p:1063-1084
    DOI: 10.1287/moor.2016.0837
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2016.0837
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2016.0837?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. J. E. Spingarn & R. T. Rockafellar, 1979. "The Generic Nature of Optimality Conditions in Nonlinear Programming," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 425-430, November.
    2. Jian Huang & Shuange Ma & Huiliang Xie & Cun-Hui Zhang, 2009. "A group bridge approach for variable selection," Biometrika, Biometrika Trust, vol. 96(2), pages 339-355.
    3. Fan J. & Li R., 2001. "Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 1348-1360, December.
    4. J. V. Burke & A. S. Lewis & M. L. Overton, 2002. "Approximating Subdifferentials by Random Sampling of Gradients," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 567-584, August.
    5. Wenyu Sun & Ya-Xiang Yuan, 2006. "Optimization Theory and Methods," Springer Optimization and Its Applications, Springer, number 978-0-387-24976-6, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hao Wang & Fan Zhang & Yuanming Shi & Yaohua Hu, 2021. "Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods," Journal of Global Optimization, Springer, vol. 81(3), pages 717-748, November.
    2. Fan Wu & Wei Bian, 2020. "Accelerated iterative hard thresholding algorithm for $$l_0$$l0 regularized regression problem," Journal of Global Optimization, Springer, vol. 76(4), pages 819-840, April.
    3. Xian Zhang & Dingtao Peng, 2022. "Solving constrained nonsmooth group sparse optimization via group Capped- $$\ell _1$$ ℓ 1 relaxation and group smoothing proximal gradient algorithm," Computational Optimization and Applications, Springer, vol. 83(3), pages 801-844, December.
    4. Tianxiang Liu & Ting Kei Pong & Akiko Takeda, 2023. "Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints," Computational Optimization and Applications, Springer, vol. 86(2), pages 521-553, November.
    5. Bo Wen & Xiaojun Chen & Ting Kei Pong, 2018. "A proximal difference-of-convex algorithm with extrapolation," Computational Optimization and Applications, Springer, vol. 69(2), pages 297-324, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shuichi Kawano, 2014. "Selection of tuning parameters in bridge regression models via Bayesian information criterion," Statistical Papers, Springer, vol. 55(4), pages 1207-1223, November.
    2. Loann David Denis Desboulets, 2018. "A Review on Variable Selection in Regression Analysis," Econometrics, MDPI, vol. 6(4), pages 1-27, November.
    3. Takumi Saegusa & Tianzhou Ma & Gang Li & Ying Qing Chen & Mei-Ling Ting Lee, 2020. "Variable Selection in Threshold Regression Model with Applications to HIV Drug Adherence Data," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 12(3), pages 376-398, December.
    4. Yuanjia Wang & Huaihou Chen & Runze Li & Naihua Duan & Roberto Lewis-Fernández, 2011. "Prediction-Based Structured Variable Selection through the Receiver Operating Characteristic Curves," Biometrics, The International Biometric Society, vol. 67(3), pages 896-905, September.
    5. Pei Wang & Shunjie Chen & Sijia Yang, 2022. "Recent Advances on Penalized Regression Models for Biological Data," Mathematics, MDPI, vol. 10(19), pages 1-24, October.
    6. Yanfang Zhang & Chuanhua Wei & Xiaolin Liu, 2022. "Group Logistic Regression Models with l p,q Regularization," Mathematics, MDPI, vol. 10(13), pages 1-15, June.
    7. Hu, Jianhua & Liu, Xiaoqian & Liu, Xu & Xia, Ningning, 2022. "Some aspects of response variable selection and estimation in multivariate linear regression," Journal of Multivariate Analysis, Elsevier, vol. 188(C).
    8. Xia Cui & Heng Peng & Songqiao Wen & Lixing Zhu, 2013. "Component Selection in the Additive Regression Model," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 40(3), pages 491-510, September.
    9. Yanming Li & Bin Nan & Ji Zhu, 2015. "Multivariate sparse group lasso for the multivariate multiple linear regression with an arbitrary group structure," Biometrics, The International Biometric Society, vol. 71(2), pages 354-363, June.
    10. Mehmet Caner & Xu Han, 2014. "Selecting the Correct Number of Factors in Approximate Factor Models: The Large Panel Case With Group Bridge Estimators," Journal of Business & Economic Statistics, Taylor & Francis Journals, vol. 32(3), pages 359-374, July.
    11. Huang Hailin & Shangguan Jizi & Ruan Peifeng & Liang Hua, 2019. "Bi-level feature selection in high dimensional AFT models with applications to a genomic study," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 18(5), pages 1-11, October.
    12. Zhang, Xin & Zhao, Junlong, 2024. "Group variable selection via group sparse neural network," Computational Statistics & Data Analysis, Elsevier, vol. 192(C).
    13. Zhigeng Geng & Sijian Wang & Menggang Yu & Patrick O. Monahan & Victoria Champion & Grace Wahba, 2015. "Group variable selection via convex log-exp-sum penalty with application to a breast cancer survivor study," Biometrics, The International Biometric Society, vol. 71(1), pages 53-62, March.
    14. Behrendt, Simon & Schweikert, Karsten, 2021. "A Note on Adaptive Group Lasso for Structural Break Time Series," Econometrics and Statistics, Elsevier, vol. 17(C), pages 156-172.
    15. Shanshan Qin & Hao Ding & Yuehua Wu & Feng Liu, 2021. "High-dimensional sign-constrained feature selection and grouping," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 73(4), pages 787-819, August.
    16. Kaida Cai & Hua Shen & Xuewen Lu, 2022. "Adaptive bi-level variable selection for multivariate failure time model with a diverging number of covariates," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(4), pages 968-993, December.
    17. Jianyu Liu & Wei Sun & Yufeng Liu, 2019. "Joint skeleton estimation of multiple directed acyclic graphs for heterogeneous population," Biometrics, The International Biometric Society, vol. 75(1), pages 36-47, March.
    18. Hu, Jianhua & Xin, Xin & You, Jinhong, 2014. "Model determination and estimation for the growth curve model via group SCAD penalty," Journal of Multivariate Analysis, Elsevier, vol. 124(C), pages 199-213.
    19. Qu, Lianqiang & Song, Xinyuan & Sun, Liuquan, 2018. "Identification of local sparsity and variable selection for varying coefficient additive hazards models," Computational Statistics & Data Analysis, Elsevier, vol. 125(C), pages 119-135.
    20. Lee, Sangin & Lee, Youngjo & Pawitan, Yudi, 2018. "Sparse pathway-based prediction models for high-throughput molecular data," Computational Statistics & Data Analysis, Elsevier, vol. 126(C), pages 125-135.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:42:y:2017:i:4:p:1063-1084. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.