A novel neural network to nonlinear complex-variable constrained nonconvex optimization

被引:8
作者
Feng, Jiqiang [1 ]
Chai, Yiyuan [1 ]
Xu, Chen [1 ]
机构
[1] Shenzhen Univ, Coll Math & Stat, Shenzhen Key Lab Adv Machine Learning & Applicat, Shenzhen 518060, Peoples R China
来源
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS | 2021年 / 358卷 / 08期
基金
美国国家科学基金会;
关键词
PSEUDOCONVEX OPTIMIZATION; NEURODYNAMIC APPROACH; CONVEX-OPTIMIZATION; STABILITY; EQUALITY;
D O I
10.1016/j.jfranklin.2021.02.029
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a novel complex-valued neural network (CVNN) is proposed to investigate a nonlinear complex-variable nonconvex optimization problem (CVNOP) subject to general types of convex constraints, including inequality and bounded as well as equality constraints. The designed neural network is available to search the critical point set of CVNOP. In contrast with other related neural networks to complex-variable optimization problem, network herein contains fewer neurons and does not depend on exact penalty parameters. To our best knowledge, this is the first attempt to exploit the neural network to solve nonconvex complex-variable optimization problem. Furthermore, the presented network is also capable of solving convex or nonconvex real-variable optimization problem (RVNOP). Different from other existing neural networks for RVNOP, our network avoids the redundant computation of inverse matrix and relaxes some additional assumptions, comprising the objective function is bounded below over the feasible region or the objective function is coercive. Several numerical illustrations and practical results in beamforming provide the viability of the proposed network. (C) 2021 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:4435 / 4457
页数:23
相关论文
共 40 条
[1]  
[Anonymous], 2009, UCSDECE275CG S2009V1
[2]  
Aubin J.-P., 1991, Viability theory
[3]  
Bazaraa M.S., 2006, Nonlinear Programming: Theory and Algorithms
[4]   Neural network for nonsmooth pseudoconvex optimization with general convex constraints [J].
Bian, Wei ;
Ma, Litao ;
Qin, Sitian ;
Xue, Xiaoping .
NEURAL NETWORKS, 2018, 101 :1-14
[5]  
Boyd S., 2009, Convex Optimization, DOI DOI 10.1017/CBO9780511804441
[6]   ADAPTIVE BEAMFORMING USING THE CONSTRAINED KALMAN FILTER [J].
CHEN, YH ;
CHIANG, CT .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 1993, 41 (11) :1576-1580
[7]  
Clarke FH., 1983, OPTIMIZATION NONSMOO
[8]   A penalty-like neurodynamic approach to constrained nonsmooth distributed convex optimization [J].
Jiang, Xinrui ;
Qin, Sitian ;
Xue, Xiaoping .
NEUROCOMPUTING, 2020, 377 :225-233
[9]   A one-layer recurrent neural network for constrained nonconvex optimization [J].
Li, Guocheng ;
Yan, Zheng ;
Wang, Jun .
NEURAL NETWORKS, 2015, 61 :10-21
[10]   Distributed consensus-based multi-agent convex optimization via gradient tracking technique [J].
Li, Huaqing ;
Zhang, Hao ;
Wang, Zheng ;
Zhu, Yifan ;
Han, Qi .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2019, 356 (06) :3733-3761