A Novel Collaborate Neural Dynamic System Model for Solving a Class of Min–Max Optimization Problems with an Application in Portfolio Management

2018 ◽  
Vol 62 (7) ◽  
pp. 1061-1085
Author(s):  
Alireza Nazemi ◽  
Marziyeh Mortezaee

Abstract In this paper, we describe a new neural network model for solving a class of non-smooth optimization problems with min–max objective function. The basic idea is to replace the min–max function by a smooth one using an entropy function. With this smoothing technique, the non-smooth problem is converted into an equivalent differentiable convex programming problem. A neural network model is then constructed based on Karush–Kuhn–Tucker optimality conditions. It is investigated that the proposed neural network is stable in the sense of Lyapunov and can converge to an exact optimal solution of the original problem. As an application in economics, we use the proposed scheme to a min–max portfolio optimization problems. The effectiveness of the method is demonstrated by several numerical simulations.

1995 ◽  
Vol 51 (4) ◽  
pp. R2693-R2696 ◽  
Author(s):  
Yoshinori Hayakawa ◽  
Atsushi Marumoto ◽  
Yasuji Sawada

2006 ◽  
Vol 16 (04) ◽  
pp. 295-303 ◽  
Author(s):  
YONGQING YANG ◽  
JINDE CAO

In this paper, the delayed projection neural network for a class of solving convex programming problem is proposed. The existence of solution and global exponential stability of the proposed network are proved, which can guarantee to converge at an exact optimal solution of the convex programming problems. Several examples are given to show the effectiveness of the proposed network.


Sign in / Sign up

Export Citation Format

Share Document