A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
DOI10.1016/J.NEUNET.2018.10.010zbMATH Open1472.90128OpenAlexW2898406129WikidataQ93008818 ScholiaQ93008818MaRDI QIDQ2182907FDOQ2182907
Authors: Na Liu, Sitian Qin
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
Recommendations
- 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
global convergencecritical pointsLyapunov functionrecurrent neural networknonlinear optimization problemsslow solution
Learning and adaptive systems in artificial intelligence (68T05) Nonlinear programming (90C30) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Sliding modes in control and optimization. Transl. from the Russian
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Direct trajectory optimization using nonlinear programming and collocation
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Bayesian Compressive Sensing
- Lagrange programming neural networks
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- Minimizing the Condition Number of a Gram Matrix
- Optimizing condition numbers
- Using sliding modes in static optimization and nonlinear programming
- A neurodynamic approach to convex optimization problems with general constraint
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- A one-layer recurrent neural network for constrained nonconvex optimization
- Neural network for constrained nonsmooth optimization using Tikhonov regularization
- Dynamical Analysis of Full-Range Cellular Neural Networks by Exploiting Differential Variational Inequalities
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- Concrete Structure Design using Mixed-Integer Nonlinear Programming with Complementarity Constraints
Cited In (20)
- Relationship between time-instant number and precision of ZeaD formulas with proofs
- General 9-instant discrete-time Zhang neural network for time-dependent applications
- Finite time convergent recurrent neural network for variational inequality problems subject to equality constraints
- Neural network for a class of sparse optimization with \(L_0\)-regularization
- Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
- A neurodynamic optimization approach to supervised feature selection via fractional programming
- A neurodynamic approach for nonsmooth optimal power consumption of intelligent and connected vehicles
- Recurrent neural network with noise rejection for cyclic motion generation of robotic manipulators
- A novel neural network to nonlinear complex-variable constrained nonconvex optimization
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
- Solving time-varying linear inequalities by finite-time convergent zeroing neural networks
- New models for solving time-varying LU decomposition by using ZNN method and ZeaD formulas
- Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints
- A nonpenalty neurodynamic model for complex-variable optimization
- A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization
- Neurodynamics-driven portfolio optimization with targeted performance criteria
- A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints
- Neurodynamics-driven holistic approaches to semi-supervised feature selection
- An adaptive generalized Nash equilibrium seeking algorithm under high-dimensional input dead-zone
- A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints
Uses Software
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)