A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
The paper deals with the weakest possible conditions that optimization problems can be treated by using a recurrent neural network. Convex, generalized convex as well as nonlinear nonconvex problems are considered. The Introduction gives a good overview of the existing results in the literature, followed by four remarks showing that the network used in this paper is really new. Chapter 2 recalls needed definitions. Chapter 3 gives the optimization problem P (finite-dimensional space, convex inequalities, linear equalities with full row rank, the objective function is not necessarily convex or smooth), where some conditions must be fulfilled: Slater conditions, boundedness of the feasible domain, regularity and Lipschitz property of the objective function. Furthermore, the recurrent neural network to solve P is presented being a nonautonomous differential inclusion. Two figures support the mathematical presentation. Chapter 4 gives the theoretical analysis starting with the definition of a critical point of P and the state solution of the network together with its convergence behavior as for instance that the state of neural network enters the feasible region in finite time and remains thereafter, about the distance to the set of critical points and about relations to Kuhn-Tucker points of P and finally, if the objective function is pseudoconvex, then the state of the network is globally convergent to an optimal solution of P. Chapter 5 starts with the definition of a slow solution of a (common) differential inclusion and it is shown, that a solution of the network (with special initial point) is just its slow solution and is unique, if the objective function is convex Five test examples with remarks and figures supplement the paper.
- A neurodynamic approach to convex optimization problems with general constraint
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
- Neurodynamic optimization approaches with finite/fixed-time convergence for absolute value equations
- A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints.
- A novel neurodynamic reaction-diffusion model for solving linear variational inequality problems and its application
- Development and Analysis of a Neural Dynamical Approach to Nonlinear Programming Problems
- An Analysis of a Neural Dynamical Approach to Solving Optimization Problems
- Novel projection neurodynamic approaches for constrained convex optimization
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- A neurodynamic approach to convex optimization problems with general constraint
- A one-layer recurrent neural network for constrained nonconvex optimization
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Bayesian Compressive Sensing
- Concrete Structure Design using Mixed-Integer Nonlinear Programming with Complementarity Constraints
- Direct trajectory optimization using nonlinear programming and collocation
- Dynamical Analysis of Full-Range Cellular Neural Networks by Exploiting Differential Variational Inequalities
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 4027357 (Why is no real title available?)
- scientific article; zbMATH DE number 735099 (Why is no real title available?)
- Lagrange programming neural networks
- Minimizing the Condition Number of a Gram Matrix
- Neural network for constrained nonsmooth optimization using Tikhonov regularization
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- Optimization and nonsmooth analysis
- Optimizing condition numbers
- Sliding modes in control and optimization. Transl. from the Russian
- Using sliding modes in static optimization and nonlinear programming
- 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
- 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
- Solving time-varying linear inequalities by finite-time convergent zeroing neural networks
- A neurodynamic approach to convex optimization problems with general constraint
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- A nonpenalty neurodynamic model for complex-variable optimization
- Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique.
- A class of neural networks for solving optimization problems with global attractivity
- Smoothing neural network for L₀ 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₀-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
- Neurodynamics-driven holistic approaches to semi-supervised feature selection
- An adaptive generalized Nash equilibrium seeking algorithm under high-dimensional input dead-zone
- Neurodynamic optimization model for bilevel programming with pseudoconvex upper-level optimization
- Relationship between time-instant number and precision of ZeaD formulas with proofs
This page was built for publication: A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182907)
