Computer Science ›› 2019, Vol. 46 ›› Issue (11): 228-234.doi: 10.11896/jsjkx.181001926

• Artificial Intelligence • Previous Articles     Next Articles

New Neural Network Method for Solving Nonsmooth Pseudoconvex Optimization Problems

YU Xin, MA Chong, HU Yue, WU Ling-zhen, WANG Yan-lin   

  1. (Department of Computer and Electronic Information,Guangxi University,Nanning 530004,China)
  • Received:2018-10-16 Online:2019-11-15 Published:2019-11-14

Abstract: The research of optimization problem is favored by researchers.As an important part of optimization pro-blem,convex optimization problem is the focus of research.Many models based on neural network are applied to practical problems.However,the optimization problems involved in machine learning,signal processing,bioinformatics and other fields are often not convex optimization problems,but pseudoconvex optimization and nonconvex optimization problems.Therefore,it is urgent to solve the latter kind of problems.To solve the optimization problem that the objective function is nonsmooth pseudoconvex function and constraint function is equality and inequality function,this paper constructeda new single-layer neural network model without penalty parameter based on the idea of penalty function and differential inclusion.The main idea of the design is that according to the proposed neural network model,a constrained function can be designed for the gradient of the objective function so that the value of the objective function is always kept within a range,and then a function about time is combined to ensure that its value decreases with time.At the same time,considering that inequality constraints affect the convergence direction of the state solution before it enters the equation constraint,a conditional function is added to restrict it.Compared with the proposed neural network model,it has the advantages of simple structure,no need to calculate penalty parameters in advance,and no special requirements for the position of the initial point.Furthermore,it is theoretically proved that for any initial point,the state solution can converge to the equality constraints in finite time and stay there thereafter,the boundedness of the state solution,the state solution can converge to the feasible region in finite time and stay there thereafter,and the state solution can finally converge to the optimal solution of the optimization problem.Under the environment of MATLAB,by mathematical simulation experiments,the state solution can converge to the optimal solution quickly.At the same time,if the penalty parameters or initial points are not selected properly,the state solution will not converge well when the same optimization problem is solved by using the proposed similar neural network model.This not only verifies the correctness of the theoretical results,but also shows that the proposed network has a wider range of applications.

Key words: Differential inclusion, Neural network, Nonsmooth optimization, Pseudoconvex function

CLC Number: 

  • TP183
[1]TANK D W,HOPFIELD J J.Simple ‘neural’ optimization networks:An A/D converter,signal decision circuit,and a linear programming circuit[J].IEEE Transaction Circuits System,1986,33(5):533-541.
[2]KENNEDY M P,CHUA L O.Neural Networks for Nonlinear Programming[J].IEEE Trans.Circuits Syst.,1988,35(5):554-562.
[3]GAO X B.A novel neural network for nonlinear convex programming[J].IEEE Transactions on Neural Networks,2004,15(3):613-621.
[4]LIU Q,WANG J.A one-layer recurrent neural network with a discontinuous hard-limiting activation function for quadratic programming[J].IEEE Trans.Neural Netw.,2008,19(4):558-570.
[5]QIN S T,XUE X P.A two-layer recurrent neural network for nonsmooth convex optimization problems[J].IEEE Trans.Neural Netw.and Learn.Syst.,2015,26(6):1149-1160.
[6]LI Q,LIU Y,ZHU L.Neural network for nonsmooth pseudoconvex optimization with general constraints[J].Neurocomputing,2014,131(131):336-347.
[7]QIN S T,YANG X,XUE X P,et al.A one-Layer recurrent neural network for pseudoconvex optimization problems with equa-lity and inequality constraints[J].IEEE Trans. Cybern,2017,47(10):3063-3074.
[8]BIAN W,MA L T,QIN S T,et al.Neural network for nonsmooth pseudconvex optimization with general convex constraints[J].Neural Networks,2018,101:1-14.
[9]AUBIN J P,FRANKOWSKA H.Set-Valued Analysis[M].Berlin,Germany:Birkäuser,1990:1-39.
[10]CLARKE F.Optimization and Non-Smooth Analysis[M].New York:Wiley,1983:25-155.
[11]AUBIN J P,CELLINA A.Differential Inclusions[M].Berlin,Germany:Springer-Verlag,1984:78-164.
[12]BETOUNES D.Differential Equations:Theory and Applications[M].New York:Springer-Verlag,2009:100-203.
[13]FORTI M,NISTRI P,QUINCAMPOIX M.Generalized neural network for nonsmooth nonlinear programming problems[J].IEEE Transactions on Circuits & Systems I Regular Papers,2004,51(9):1741-1754.
[14]BIAN W,XUE X P.Subgradient-based neural networks for nonsmooth convex optimization problems[J].IEEE Trans.Circuits Syst.I,2008,55(8):2378-2391.
[15]LIU Q,WANG J.A one-Layer recurrent neural network forconstrained nonsmooth optimization[J].IEEE Transactions on Systems Man & Cybernetics Part B,2011,41(5):1323-1333.
[16]QIN S,FAN D,WU G,et al.Neural network for constrainednonsmooth optimization using Tikhonov regularization[J].Neural Netw,2015,63(C):272-281.
[17]LIU S,WANG J.A simplified dual neural network for quadratic programming with its KWTA application[J].IEEE Transactions on Neural Networks,2006,17(6):1500.
[18]LI G C,SONG S J,WU C.Generalized gradient projection neural networks for nonsmooth optimization problems[J].Science China (Information Sciences),2010,53(5):990-1005.
[19]BIAN W,XUE X P.Neural network for solving constrainedconvex optimization problems with global attractivity[J].IEEE Trans.Circuits Syst.I,2013,60(3):710-723.
[20]BIAN W,XUE X P.Subgradient-based neural networks for nonsmooth nonconvex optimization problems[J].IEEE Trans.Nneural Netw.,2009,20(6):1024-1038.
[21]WANG J.A deterministic annealing neural network for convex programming[J].Neural Networks,1994,7(4):629-641.
[22]GAO X,LIAO L Z.A new one-layer neural network for linear and quadratic programming[J].IEEE Transactions on Neural Networks,2010,21(6):918.
[23]CHENG L,HOU Z G,LIN Y,et al.Recurrent neural network for non-smooth convex optimization problems with application to the identification of genetic regulatory networks[J].IEEE Trans.Neural Netw.,2011,22(5):714-726.
[24]HOSSENINI A.A non-penalty recurrent neural network forsolving a class of constrained optimization problems[J].Neural Networks,2016,73:10-25.
[25]FORTI M,NISTRI P,QUINCAMPOIX M.Convergence ofneural network for programming problems via a nonsmooth Lojasiewicz Inequlity[J].IEEE Trans.Neural Netw.,2006,17(6):1471-1486.
[26]LIU Q S,GUO Z S,WANG J.A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization[J].Neural Networks,2011,26:99-109.
[27]BIAN W,XUE X P.Neural network for solving constrainedconvex optimization problems with global attractivity[J].IEEE Trans.Circuits Syst.I,2013,60(3):710-723.
[1] ZHOU Fang-quan, CHENG Wei-qing. Sequence Recommendation Based on Global Enhanced Graph Neural Network [J]. Computer Science, 2022, 49(9): 55-63.
[2] ZHOU Le-yuan, ZHANG Jian-hua, YUAN Tian-tian, CHEN Sheng-yong. Sequence-to-Sequence Chinese Continuous Sign Language Recognition and Translation with Multi- layer Attention Mechanism Fusion [J]. Computer Science, 2022, 49(9): 155-161.
[3] NING Han-yang, MA Miao, YANG Bo, LIU Shi-chang. Research Progress and Analysis on Intelligent Cryptology [J]. Computer Science, 2022, 49(9): 288-296.
[4] HAO Zhi-rong, CHEN Long, HUANG Jia-cheng. Class Discriminative Universal Adversarial Attack for Text Classification [J]. Computer Science, 2022, 49(8): 323-329.
[5] WANG Run-an, ZOU Zhao-nian. Query Performance Prediction Based on Physical Operation-level Models [J]. Computer Science, 2022, 49(8): 49-55.
[6] CHEN Yong-quan, JIANG Ying. Analysis Method of APP User Behavior Based on Convolutional Neural Network [J]. Computer Science, 2022, 49(8): 78-85.
[7] ZHU Cheng-zhang, HUANG Jia-er, XIAO Ya-long, WANG Han, ZOU Bei-ji. Deep Hash Retrieval Algorithm for Medical Images Based on Attention Mechanism [J]. Computer Science, 2022, 49(8): 113-119.
[8] YAN Jia-dan, JIA Cai-yan. Text Classification Method Based on Information Fusion of Dual-graph Neural Network [J]. Computer Science, 2022, 49(8): 230-236.
[9] QI Xiu-xiu, WANG Jia-hao, LI Wen-xiong, ZHOU Fan. Fusion Algorithm for Matrix Completion Prediction Based on Probabilistic Meta-learning [J]. Computer Science, 2022, 49(7): 18-24.
[10] YANG Bing-xin, GUO Yan-rong, HAO Shi-jie, Hong Ri-chang. Application of Graph Neural Network Based on Data Augmentation and Model Ensemble in Depression Recognition [J]. Computer Science, 2022, 49(7): 57-63.
[11] ZHANG Ying-tao, ZHANG Jie, ZHANG Rui, ZHANG Wen-qiang. Photorealistic Style Transfer Guided by Global Information [J]. Computer Science, 2022, 49(7): 100-105.
[12] DAI Zhao-xia, LI Jin-xin, ZHANG Xiang-dong, XU Xu, MEI Lin, ZHANG Liang. Super-resolution Reconstruction of MRI Based on DNGAN [J]. Computer Science, 2022, 49(7): 113-119.
[13] LIU Yue-hong, NIU Shao-hua, SHEN Xian-hao. Virtual Reality Video Intraframe Prediction Coding Based on Convolutional Neural Network [J]. Computer Science, 2022, 49(7): 127-131.
[14] XU Ming-ke, ZHANG Fan. Head Fusion:A Method to Improve Accuracy and Robustness of Speech Emotion Recognition [J]. Computer Science, 2022, 49(7): 132-141.
[15] PENG Shuang, WU Jiang-jiang, CHEN Hao, DU Chun, LI Jun. Satellite Onboard Observation Task Planning Based on Attention Neural Network [J]. Computer Science, 2022, 49(7): 242-247.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!