Delayed Lagrangian neural networks for solving convex programming problems

被引：17
|
作者：
Li, Fen [1 ,2 ]
机构：
[1] Yunnan Vocat Coll Mech & Elect Technol, Dept Elect Engn, Kunming 650203, Peoples R China
[2] Beijing Univ Posts & Telecommun, Econ & Management Sch, Beijing 100876, Peoples R China
来源：
NEUROCOMPUTING | 2010年 / 73卷 / 10-12期
关键词：
Lagrangian programming neural networks; Delay; Global convergence; Optimization problem; Lyapunov functional; GLOBAL ASYMPTOTIC STABILITY; DUAL ASSIGNMENT NETWORKS; EXPONENTIAL STABILITY; OPTIMIZATION; CONSTRAINTS;
D O I：
10.1016/j.neucom.2010.01.009
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, the global convergence is further studied for the Lagrangian programming neural networks. A delayed Lagrangian programming neural network is proposed for solving a class of convex programming problems with equality constraints. Based on Lyapunov method, it is proved that the delayed Lagrangian networks are stable and globally convergent under some conditions. Simulation examples are provided to show that the Lagrangian networks with delay are more effective than that without delays by choosing proper delays. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：2266 / 2273
页数：8
相关论文
共 50 条
  • [41] MODIFICATION OF PENALTY FUNCTION METHOD FOR SOLVING CONVEX PROGRAMMING PROBLEMS
    GORSKIY, AA
    [J]. ENGINEERING CYBERNETICS, 1971, 9 (06): : 993 - &
  • [42] A Discrete-time Projection Neural Network for Solving Convex Quadratic Programming Problems with Hybrid Constraints
    Fengqiu Liu
    Jianmin Wang
    Hongxu Zhang
    Pengfei Li
    [J]. International Journal of Control, Automation and Systems, 2023, 21 : 328 - 337
  • [43] A Discrete-time Projection Neural Network for Solving Convex Quadratic Programming Problems with Hybrid Constraints
    Liu, Fengqiu
    Wang, Jianmin
    Zhang, Hongxu
    Li, Pengfei
    [J]. INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2023, 21 (01) : 328 - 337
  • [44] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS
    FISHER, ML
    [J]. MANAGEMENT SCIENCE, 1981, 27 (01) : 1 - 18
  • [45] A log-sigmoid Lagrangian neural network for solving nonlinear programming
    Zhou, Limei
    Zhang, Liwei
    [J]. SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 427 - +
  • [46] CALCULATION OF NETWORKS AND THE DUAL PROBLEMS OF CONVEX-PROGRAMMING
    OBRAZTSOV, IF
    GVISHIANI, AD
    GUVICH, VA
    [J]. DOKLADY AKADEMII NAUK SSSR, 1986, 287 (05): : 1062 - 1067
  • [47] Explicit model of dual programming and solving method for a class of separable convex programming problems
    Sui, YunKang
    Peng, XiRong
    [J]. ENGINEERING OPTIMIZATION, 2019, 51 (09) : 1604 - 1625
  • [48] A new neural network for solving linear programming problems
    Cichocki, A
    Unbehauen, R
    Weinzierl, K
    Holzel, R
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (02) : 244 - 256
  • [49] Neural network for solving extended linear programming problems
    Xia, YS
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1997, 8 (03): : 803 - 806
  • [50] A Neural Network for Solving Nonlinear Multilevel Programming Problems
    Feng Xiangdong
    Hu Guanghua
    [J]. CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 1521 - 1526
12345