A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints

This paper presents a neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints. The proposed neural network endows with a time-varying auxiliary function, which can guarantee that the state of the neural network enters the feasible region in finite time and remains there thereafter. Moreover, the state with any initial point is shown to be convergent to the critical point set when the objective function is generally nonconvex. Especially, when the objective function is pseudoconvex (or convex), the state is proved to be globally convergent to an optimal solution of the considered optimization problem. Compared with other neural networks for related optimization problems, the proposed neural network in this paper has good convergence and does not depend on some additional assumptions, such as the assumption that the inequality feasible region is bounded, the assumption that the penalty parameter is sufficiently large and the assumption that the objective function is lower bounded over the equality feasible region. Finally, some numerical examples and an application in real-time data reconciliation are provided to display the well performance of the proposed neural network.

[1]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Subject to Linear Equality Constraints , 2011, IEEE Transactions on Neural Networks.

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

[3]  Sitian Qin,et al.  A new one-layer recurrent neural network for nonsmooth pseudoconvex optimization , 2013, Neurocomputing.

[4]  Xiaojun Chen,et al.  Smoothing Neural Network for Constrained Non-Lipschitz Optimization With Applications , 2012, IEEE Transactions on Neural Networks and Learning Systems.

[5]  Qingshan Liu,et al.  A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization , 2012, Neural Networks.

[6]  C. Hargraves,et al.  DIRECT TRAJECTORY OPTIMIZATION USING NONLINEAR PROGRAMMING AND COLLOCATION , 1987 .

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

[8]  Sven Leyffer,et al.  Concrete Structure Design using Mixed-Integer Nonlinear Programming with Complementarity Constraints , 2011, SIAM J. Optim..

[9]  Qingshan Liu,et al.  A One-Layer Projection Neural Network for Nonsmooth Optimization Subject to Linear Equalities and Bound Constraints , 2013, IEEE Transactions on Neural Networks and Learning Systems.

[10]  Sitian Qin,et al.  A neurodynamic approach to convex optimization problems with general constraint , 2016, Neural Networks.

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

[12]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

[13]  Yaqiu Liu,et al.  Neural network for nonsmooth pseudoconvex optimization with general constraints , 2014, Neurocomputing.

[14]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[15]  Ajit C. Tamhane,et al.  Data Reconciliation and Gross Error Detection in Chemical Process Networks , 1985 .

[16]  Xinghuo Yu,et al.  A Generalized Hopfield Network for Nonsmooth Constrained Convex Optimization: Lie Derivative Approach , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[17]  W. A. Heenan,et al.  DETECTION OF GROSS ERRORS IN NONLINEARLY CONSTRAINED DATA: A CASE STUDY , 1987 .

[18]  Jun Wang,et al.  A Novel Recurrent Neural Network for Solving Nonlinear Optimization Problems With Inequality Constraints , 2008, IEEE Transactions on Neural Networks.

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

[20]  Hua Wei,et al.  An interior point nonlinear programming for optimal power flow problems with a novel data structure , 1997 .

[21]  Sitian Qin,et al.  A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Problems With Equality and Inequality Constraints , 2017, IEEE Transactions on Cybernetics.

[22]  S. K. Korovin,et al.  Using sliding modes in static optimization and nonlinear programming , 1974, Autom..

[23]  Jun Wang,et al.  Model Predictive Control of Nonlinear Systems With Unmodeled Dynamics Based on Feedforward and Recurrent Neural Networks , 2012, IEEE Transactions on Industrial Informatics.

[24]  Ying Zhang,et al.  Logistics Park Distribution System Paths Optimization Problems Based on Cloud Computing , 2013 .

[25]  Mauro Forti,et al.  Dynamical Analysis of Full-Range Cellular Neural Networks by Exploiting Differential Variational Inequalities , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.

[26]  Leon O. Chua,et al.  Linear and nonlinear circuits , 1987 .

[27]  Xiaojun Chen,et al.  Minimizing the Condition Number of a Gram Matrix , 2011, SIAM J. Optim..

[28]  Andrzej Cichocki,et al.  Neural networks for optimization and signal processing , 1993 .

[29]  Jun Wang,et al.  A collective neurodynamic optimization approach to bound-constrained nonconvex optimization , 2014, Neural Networks.

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

[31]  Xing-Bao Gao,et al.  A novel neural network for nonlinear convex programming , 2004, IEEE Trans. Neural Networks.

[32]  Jun Wang,et al.  A One-Layer Recurrent Neural Network for Constrained Nonsmooth Optimization , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[33]  Jane J. Ye,et al.  Optimizing Condition Numbers , 2009, SIAM J. Optim..

[34]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[35]  Lijun Zhao,et al.  Neural network for constrained nonsmooth optimization using Tikhonov regularization , 2015, Neural Networks.

[36]  C. M. Crowe,et al.  Formulation of linear data reconciliation using information theory , 1996 .

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

[38]  Tie Qiu,et al.  Multivariate Chaotic Time Series Online Prediction Based on Improved Kernel Recursive Least Squares Algorithm , 2019, IEEE Transactions on Cybernetics.

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

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

[41]  Sitian Qin,et al.  Neural network for nonsmooth pseudoconvex optimization with general convex constraints , 2018, Neural Networks.