Title : ( Parametric NCP-Based Recurrent Neural Network Model: A New Strategy to Solve Fuzzy Nonconvex Optimization Problems )
Authors: Amin Mansoori , Sohrab Effati ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
The present scientific attempt is devoted to investigating the fuzzy nonconvex optimization problems (NCOPs) utilizing the concepts of recurrent neural networks (RNNs). To the best of our knowledge, this paper is the first study on finding a solution for fuzzy NCOP using RNN models. For this purpose, the original problem is reformulated into an mth power form, the interval, and then the weighting problem. Then, the Karush-Kuhn-Tucker (KKT) optimality conditions are provided for the weighting problem. The KKT conditions are used to propose the RNN model. Besides, the Lyapunov stability and the global convergence of the RNN model are proved. Finally, several illustrative examples are given to demonstrate the performance of this approach. The obtained results are compared with previous approaches for solving fuzzy NCOP.
Keywords
, Bi-objective and weighting programs , fuzzy nonconvex optimization problem (NCOP) , global Lyapunov stability , NCP function , recurrent neural network (RNN)
@article{paperid:1074467,
author = {Mansoori, Amin and Effati, Sohrab},
title = {Parametric NCP-Based Recurrent Neural Network Model: A New Strategy to Solve Fuzzy Nonconvex Optimization Problems},
journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
year = {2019},
volume = {51},
number = {4},
month = {January},
issn = {2168-2216},
pages = {2592--2601},
numpages = {9},
keywords = {Bi-objective and weighting programs
;
fuzzy nonconvex optimization problem (NCOP)
;
global Lyapunov stability
;
NCP function
;
recurrent neural network (RNN)},
}
%0 Journal Article
%T Parametric NCP-Based Recurrent Neural Network Model: A New Strategy to Solve Fuzzy Nonconvex Optimization Problems
%A Mansoori, Amin
%A Effati, Sohrab
%J IEEE Transactions on Systems, Man, and Cybernetics: Systems
%@ 2168-2216
%D 2019
