ویراساینس.
مقاله

An efficient modified neural network for solving nonlinear programming problems with hybrid constraints

Mortezaee, M.، Nazemi, A.، Sukhtsaraee, S.

چکیده

This paper presents ‎‎the optimization techniques for solving‎‎ convex programming problems with hybrid constraints‎.‎ According to the saddle point theorem‎, ‎optimization theory‎, ‎convex analysis theory‎, ‎Lyapunov stability theory and LaSalle‎‎invariance principle‎,‎ a neural network model is constructed‎.‎ The equilibrium point of the proposed model is proved to be equivalent to the optimal ‎‎solution of the original problem‎. ‎It is also shown that the proposed network model is stable in the Lyapunov sense and it is globally convergent to an exact optimal solution of the original problem‎. ‎Several practical examples are provided to show the feasibility and the efficiency of the‎method.

اسناد مشابه

  • A New Neural Network for Solving Nonlinear Programming Problems

    سند علمی۲۰۱۱ISNNYun Gao, Xianyun Xu, Yongqing Yang

    In this paper a new neural network is proposed to solve nonlinear convex programming problems. The proposed neural network is shown to be asymptotically stable in the sense of Lyapunov. Comparing with the existing neural networks, the proposed neural network has fewer state varia

  • Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning

    سند علمی۲۰۰۵CPBenjamin W. Wah, Yixin Chen

    In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Based on our observation that MINLPs in many engineering applications have highly structured constraints, we prop

  • A Feedback Neural Network for Solving Nonlinear Programming Problems with Hybrid Constraints

    مقاله‌ی دسترسی آزاد۲۰۱۲International Journal of Computer ApplicationsHamidRezaVahabi, HasanGhasabi-Oskoei

  • Differential Dynamic Programming for Solving Nonlinear Programming Problems

    سند علمی۲۰۰۹Katsuhisa Ohno

    Dynamic programming is one of the methods which utilize special structures of large-scale mathematical programming problems. Conventional dynamic programming, however, can hardly solve mathematical programming problems with many constraints. This paper proposes differential dynam

  • A Robust Algorithm for Solving Nonlinear Programming Problems

    سند علمی۲۰۰۲Int. J. Comput. Math.Yan Li, Lishan Kang, Hugo de Garis, Zhuo Kang

    In this paper, we introduce a new algorithm for solving nonlinear programming (NLP) problems. It is an extension of Guo’s algorithm[1] which possesses enhanced capabilities for solving NLP problems. These capabilities include: a) advancing the variable subspace, b) adding a searc

  • A Modified Neural Network for Quadratic Programming with Real-Time Applications

    سند علمی۲۰۰۴Youshen Xia, Gang Feng

    This paper presents a modified neural network for solving strictly quadratic programming problems with general linear constraints. It is shown that the proposed neural network is globally convergent to a unique optimal solution within a finite time. Compared with the existing pri