IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v76y2020i4d10.1007_s10898-019-00842-6.html
   My bibliography  Save this article

A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems

Author

Listed:
  • Qian Liu

    (Shandong Normal University)

  • Yuqing Xu

    (Shandong Normal University)

  • Yang Zhou

    (Shandong Normal University)

Abstract

In this paper, a class of smoothing penalty functions is proposed for optimization problems with equality, inequality and bound constraints. It is proved exact, under the condition of weakly generalized Mangasarian–Fromovitz constraint qualification, in the sense that each local optimizer of the penalty function corresponds to a local optimizer of the original problem. Furthermore, necessary and sufficient conditions are discussed for the inverse proposition of exact penalization. Based on the theoretical results in this paper, a class of smoothing penalty algorithms with feasibility verification is presented. Theories on the penalty exactness, feasibility verification and global convergence of the proposed algorithm are presented. Numerical results show that this algorithm is effective for nonsmooth nonconvex constrained optimization problems.

Suggested Citation

  • Qian Liu & Yuqing Xu & Yang Zhou, 2020. "A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems," Journal of Global Optimization, Springer, vol. 76(4), pages 745-768, April.
    • Handle: RePEc:spr:jglopt:v:76:y:2020:i:4:d:10.1007_s10898-019-00842-6
    DOI: 10.1007/s10898-019-00842-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00842-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00842-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Changyu Wang & Qian Liu & Biao Qu, 2017. "Global saddle points of nonlinear augmented Lagrangian functions," Journal of Global Optimization, Springer, vol. 68(1), pages 125-146, May.
    2. Changyu Wang & Cheng Ma & Jinchuan Zhou, 2014. "A new class of exact penalty functions and penalty algorithms," Journal of Global Optimization, Springer, vol. 58(1), pages 51-73, January.
    3. Mengwei Xu & Jane Ye & Liwei Zhang, 2015. "Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems," Journal of Global Optimization, Springer, vol. 62(4), pages 675-694, August.
    4. NESTEROV, Yu., 2005. "Smooth minimization of non-smooth functions," LIDAM Reprints CORE 1819, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Hongwei Zhang & Wei Ji & Bo Xu & Xiaowei Yu, 2024. "Optimizing Contact Force on an Apple Picking Robot End-Effector," Agriculture, MDPI, vol. 14(7), pages 1-16, June.
    2. Suxia Ma & Yuelin Gao & Bo Zhang & Wenlu Zuo, 2022. "A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints," Mathematics, MDPI, vol. 10(5), pages 1-16, February.

    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. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
    2. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Dimitris Bertsimas & Nishanth Mundru, 2021. "Sparse Convex Regression," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 262-279, January.
    4. Alexandre Belloni & Victor Chernozhukov & Lie Wang, 2013. "Pivotal estimation via square-root lasso in nonparametric regression," CeMMAP working papers CWP62/13, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    5. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "First-order methods with inexact oracle: the strongly convex case," LIDAM Discussion Papers CORE 2013016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Chao, Shih-Kang & Härdle, Wolfgang Karl & Yuan, Ming, 2016. "Factorisable multi-task quantile regression," SFB 649 Discussion Papers 2016-057, Humboldt University Berlin, Collaborative Research Center 649: Economic Risk.
    7. David Degras, 2021. "Sparse group fused lasso for model segmentation: a hybrid approach," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(3), pages 625-671, September.
    8. Yunmei Chen & Xiaojing Ye & Wei Zhang, 2020. "Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization," Computational Optimization and Applications, Springer, vol. 77(2), pages 411-432, November.
    9. Silvia Villa & Lorenzo Rosasco & Sofia Mosci & Alessandro Verri, 2014. "Proximal methods for the latent group lasso penalty," Computational Optimization and Applications, Springer, vol. 58(2), pages 381-407, June.
    10. Wenjie Huang & Xun Zhang, 2021. "Randomized Smoothing Variance Reduction Method for Large-Scale Non-smooth Convex Optimization," SN Operations Research Forum, Springer, vol. 2(2), pages 1-28, June.
    11. Le Thi Khanh Hien & Cuong V. Nguyen & Huan Xu & Canyi Lu & Jiashi Feng, 2019. "Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 541-566, May.
    12. DEVOLDER, Olivier, 2011. "Stochastic first order methods in smooth convex optimization," LIDAM Discussion Papers CORE 2011070, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Boriss Siliverstovs, 2017. "Short-term forecasting with mixed-frequency data: a MIDASSO approach," Applied Economics, Taylor & Francis Journals, vol. 49(13), pages 1326-1343, March.
    14. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
    15. David Müller & Vladimir Shikhman, 2022. "Network manipulation algorithm based on inexact alternating minimization," Computational Management Science, Springer, vol. 19(4), pages 627-664, October.
    16. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    17. M. V. Dolgopolik, 2018. "A Unified Approach to the Global Exactness of Penalty and Augmented Lagrangian Functions I: Parametric Exactness," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 728-744, March.
    18. A. Chambolle & Ch. Dossal, 2015. "On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 968-982, September.
    19. Nima Rabiei & Jose Muñoz, 2015. "AAR-based decomposition algorithm for non-linear convex optimisation," Computational Optimization and Applications, Springer, vol. 62(3), pages 761-786, December.
    20. ARAVENA, Ignacio & PAPAVASILIOU, Anthony, 2016. "An Asynchronous Distributed Algorithm for solving Stochastic Unit Commitment," LIDAM Discussion Papers CORE 2016038, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    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:spr:jglopt:v:76:y:2020:i:4:d:10.1007_s10898-019-00842-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.