A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed.

[1]  Jun Wang,et al.  A one-layer recurrent neural network for support vector machine learning , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  Shubao Liu,et al.  A Simplified Dual Neural Network for Quadratic Programming With Its KWTA Application , 2006, IEEE Transactions on Neural Networks.

[3]  P. H. Quang,et al.  Generalized Convexity of Functions and Generalized Monotonicity of Set-Valued Maps , 1997 .

[4]  Wei Bian,et al.  Subgradient-Based Neural Networks for Nonsmooth Nonconvex Optimization Problems , 2009, IEEE Transactions on Neural Networks.

[5]  Jun Wang,et al.  A recurrent neural network for solving nonlinear convex programs subject to linear constraints , 2005, IEEE Transactions on Neural Networks.

[6]  Xiaolin Hu,et al.  Solving Pseudomonotone Variational Inequalities and Pseudoconvex Optimization Problems Using the Projection Neural Network , 2006, IEEE Transactions on Neural Networks.

[7]  Jun Wang,et al.  Primal and dual assignment networks , 1997, IEEE Trans. Neural Networks.

[8]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[9]  Xiaolin Hu,et al.  Design of General Projection Neural Networks for Solving Monotone Linear Variational Inequalities and Linear and Quadratic Optimization Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  Jun Wang.  Analysis and design of a recurrent neural network for linear programming , 1993 .

[11]  Jun Wang,et al.  A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations , 2004, Neural Networks.

[12]  Tianping Chen,et al.  Dynamical Behaviors of Delayed Neural Network Systems with Discontinuous Activation Functions , 2006, Neural Computation.

[13]  Jinde Cao,et al.  A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming , 2010, Neural Computation.

[14]  Anders P. Eriksson,et al.  Efficient optimization for L∞-problems using pseudoconvexity , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[15]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network With a Discontinuous Hard-Limiting Activation Function for Quadratic Programming , 2008, IEEE Transactions on Neural Networks.

[16]  Youshen Xia,et al.  Global convergence analysis of Lagrangian networks , 2003 .

[17]  Mauro Forti,et al.  Robustness of convergence in finite time for linear programming neural networks , 2006, Int. J. Circuit Theory Appl..

[18]  Youshen Xia,et al.  A new neural network for solving linear and quadratic programming problems , 1996, IEEE Trans. Neural Networks.

[19]  Jinde Cao,et al.  A Recurrent Neural Network Based on Projection Operator for Extended General Variational Inequalities , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[20]  Mauro Forti,et al.  Generalized neural network for nonsmooth nonlinear programming problems , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[21]  Liang Jian.  Probability Criterion in Portfolio Investment Model with Commissions , 2001 .

[22]  Leon O. Chua,et al.  Neural networks for nonlinear programming , 1988 .

[23]  Aleksej F. Filippov,et al.  Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.

[24]  Xiaolin Hu,et al.  A Recurrent Neural Network for Solving a Class of General Variational Inequalities , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[25]  Anders Eriksson,et al.  Efficient Optimization for L-infinity Problems using Pseudoconvexity , 2007, ICCV 2007.

[26]  Stefen Hui,et al.  On solving constrained optimization problems with neural networks: a penalty method approach , 1993, IEEE Trans. Neural Networks.

[27]  Qingshan Liu,et al.  A Recurrent Neural Network for Non-smooth Convex Programming Subject to Linear Equality and Bound Constraints , 2006, ICONIP.

[28]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[29]  Jun Wang,et al.  A projection neural network and its application to constrained optimization problems , 2002 .

[30]  Mauro Forti,et al.  Convergence of Neural Networks for Programming Problems via a Nonsmooth Łojasiewicz Inequality , 2006, IEEE Transactions on Neural Networks.

[31]  Shouchuan Hu.  Differential equations with discontinuous right-hand sides☆ , 1991 .

[32]  Youshen Xia,et al.  A recurrent neural network for nonlinear convex optimization subject to nonlinear inequality constraints , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..

[33]  Wansheng Tang,et al.  Fractional programming model for portfolio with probability criterion , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[34]  Jun Wang,et al.  A deterministic annealing neural network for convex programming , 1994, Neural Networks.

[35]  Shengwei Zhang,et al.  Lagrange programming neural networks , 1992 .

[36]  Nicholas G. Maratos,et al.  A Nonfeasible Gradient Projection Recurrent Neural Network for Equality-Constrained Optimization Problems , 2008, IEEE Transactions on Neural Networks.

[37]  Jun Wang.  Primal and dual neural networks for shortest-path routing , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[38]  Edwin K. P. Chong,et al.  An analysis of a class of neural networks for solving linear programming problems , 1999, IEEE Trans. Autom. Control..

[39]  J. Aubin,et al.  Differential inclusions set-valued maps and viability theory , 1984 .

[40]  John J. Hopfield,et al.  Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit , 1986 .

[41]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[42]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network for Non-smooth Convex Optimization Subject to Linear Equality Constraints , 2009, ICONIP.

[43]  Liu Baodin.  PROBABILITY CRITERION IN INVENTORY SYSTEMS , 1993 .

[44]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming , 2008, Neural Computation.

[45]  Wei Bian,et al.  Subgradient-Based Neural Networks for Nonsmooth Convex Optimization Problems , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.