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

DOI10.1016/j.neunet.2018.10.010zbMath1472.90128OpenAlexW2898406129WikidataQ93008818 ScholiaQ93008818MaRDI QIDQ2182907

Sitian Qin, Na Liu

Publication date: 26 May 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2018.10.010

zbMATH Keywords

global convergenceLyapunov functionrecurrent neural networkcritical pointsnonlinear optimization problemsslow solution

Mathematics Subject Classification ID

Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items

Relationship between time-instant number and precision of ZeaD formulas with proofs, A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints, A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem, Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints, Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization, A neurodynamic approach for nonsmooth optimal power consumption of intelligent and connected vehicles, A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints, Neural network for a class of sparse optimization with \(L_0\)-regularization, Neurodynamics-driven portfolio optimization with targeted performance criteria, A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization, A neurodynamic optimization approach to supervised feature selection via fractional programming, Recurrent neural network with noise rejection for cyclic motion generation of robotic manipulators, Finite time convergent recurrent neural network for variational inequality problems subject to equality constraints, Solving time-varying linear inequalities by finite-time convergent zeroing neural networks, A novel neural network to nonlinear complex-variable constrained nonconvex optimization, New models for solving time-varying LU decomposition by using ZNN method and ZeaD formulas, General 9-instant discrete-time Zhang neural network for time-dependent applications

Uses Software

• OTIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• A one-layer recurrent neural network for constrained nonconvex optimization
• Neural network for constrained nonsmooth optimization using Tikhonov regularization
• Sliding modes in control and optimization. Transl. from the Russian
• Using sliding modes in static optimization and nonlinear programming
• Generalized convexity of functions and generalized monotonicity of set-valued maps
• Neural network for nonsmooth pseudoconvex optimization with general convex constraints
• A neurodynamic approach to convex optimization problems with general constraint
• A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
• Minimizing the Condition Number of a Gram Matrix
• Concrete Structure Design using Mixed-Integer Nonlinear Programming with Complementarity Constraints
• Optimizing Condition Numbers
• Optimization and nonsmooth analysis
• Direct trajectory optimization using nonlinear programming and collocation
• Lagrange programming neural networks
• Bayesian Compressive Sensing
• Dynamical Analysis of Full-Range Cellular Neural Networks by Exploiting Differential Variational Inequalities
• Generalized Neural Network for Nonsmooth Nonlinear Programming Problems