IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v219y2024icp424-434.html
   My bibliography  Save this article

Solving Constrained Pseudoconvex Optimization Problems with deep learning-based neurodynamic optimization

Author

Listed:
  • Wu, Dawen
  • Lisser, Abdel

Abstract

In this paper, we consider Constrained Pseudoconvex Nonsmooth Optimization Problems (CPNOPs), which are a class of nonconvex optimization problems. Due to their nonconvexity, classical convex optimization algorithms are unable to solve them, while existing methods, i.e., numerical integration methods, are inadequate in terms of computational performance. In this paper, we propose a novel approach for solving CPNOPs that combines neurodynamic optimization with deep learning. We construct an initial value problem (IVP) involving a system of ordinary differential equations for a CPNOP and use a surrogate model based on a neural network to approximate the IVP. Our approach transforms the CPNOP into a neural network training problem, leveraging the power of deep learning infrastructure to improve computational performance and eliminate the need for traditional optimization solvers. Our experimental results show that our approach is superior to numerical integration methods in terms of both solution quality and computational efficiency.

Suggested Citation

  • Wu, Dawen & Lisser, Abdel, 2024. "Solving Constrained Pseudoconvex Optimization Problems with deep learning-based neurodynamic optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 219(C), pages 424-434.
    • Handle: RePEc:eee:matcom:v:219:y:2024:i:c:p:424-434
    DOI: 10.1016/j.matcom.2023.12.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475423005396
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2023.12.032?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. Liao, Guangyuan & Zhang, Limin, 2022. "Solving flows of dynamical systems by deep neural networks and a novel deep learning algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 202(C), pages 331-342.
    2. Bo Jiang & Tianyi Lin & Shiqian Ma & Shuzhong Zhang, 2019. "Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis," Computational Optimization and Applications, Springer, vol. 72(1), pages 115-157, January.
    Full references (including those not matched with items on IDEAS)

    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. Andreas Themelis & Lorenzo Stella & Panagiotis Patrinos, 2022. "Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms," Computational Optimization and Applications, Springer, vol. 82(2), pages 395-440, June.
    2. Jefferson G. Melo & Renato D. C. Monteiro & Hairong Wang, 2024. "A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 388-420, July.
    3. Maryam Yashtini, 2021. "Multi-block Nonconvex Nonsmooth Proximal ADMM: Convergence and Rates Under Kurdyka–Łojasiewicz Property," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 966-998, September.
    4. Kaizhao Sun & X. Andy Sun, 2023. "A two-level distributed algorithm for nonconvex constrained optimization," Computational Optimization and Applications, Springer, vol. 84(2), pages 609-649, March.
    5. Maryam Yashtini, 2022. "Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 913-939, December.
    6. Zehui Jia & Xue Gao & Xingju Cai & Deren Han, 2021. "Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 188(1), pages 1-25, January.
    7. Weiwei Kong & Renato D. C. Monteiro, 2023. "An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems," Computational Optimization and Applications, Springer, vol. 85(2), pages 509-545, June.
    8. Yue Xie & Uday V. Shanbhag, 2021. "Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$ ℓ 0 -minimization problems," Computational Optimization and Applications, Springer, vol. 78(1), pages 43-85, January.
    9. Xihua Zhu & Jiangze Han & Bo Jiang, 2022. "An adaptive high order method for finding third-order critical points of nonconvex optimization," Journal of Global Optimization, Springer, vol. 84(2), pages 369-392, October.
    10. Qihang Lin & Runchao Ma & Yangyang Xu, 2022. "Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization," Computational Optimization and Applications, Springer, vol. 82(1), pages 175-224, May.

    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:eee:matcom:v:219:y:2024:i:c:p:424-434. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.