A neurodynamic optimization approach for complex-variables programming problem
From MaRDI portal
Publication:2055053
DOI10.1016/J.NEUNET.2020.06.012zbMATH Open1475.90058OpenAlexW3035534429WikidataQ96618452 ScholiaQ96618452MaRDI QIDQ2055053FDOQ2055053
Authors: Yanyan Li 
Publication date: 3 December 2021
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2020.06.012
Recommendations
- A nonpenalty neurodynamic model for complex-variable optimization
- A novel neural network to nonlinear complex-variable constrained nonconvex optimization
- A complex-valued neural dynamical optimization approach and its stability analysis
- A dynamic system model for solving convex nonlinear optimization problems
- A new nonlinear neural network for solving convex nonlinear programming problems
Cites Work
- Generalized Lyapunov approach for convergence of neural networks with discontinuous or non-Lipschitz activations
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- On compressive sensing applied to radar
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
- A recurrent neural network for solving a class of generalized convex optimization problems
- A complex-valued neural dynamical optimization approach and its stability analysis
- Minimal properties of Moore-Penrose inverses
- A fully adaptive normalized nonlinear gradient descent algorithm for complex-valued nonlinear adaptive filters
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- Solving the XOR and Parity \(n\) problems using a single universal binary neuron
- A non-penalty recurrent neural network for solving a class of constrained optimization problems
Cited In (9)
- A neurodynamic approach to zero-one quadratic programming
- Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
- A neurodynamic optimization approach to supervised feature selection via fractional programming
- A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem
- A novel neural network to nonlinear complex-variable constrained nonconvex optimization
- Two-timescale projection neural networks in collaborative neurodynamic approaches to global optimization and distributed optimization
- A nonpenalty neurodynamic model for complex-variable optimization
- Neurodynamics-driven holistic approaches to semi-supervised feature selection
- A complex-valued neural dynamical optimization approach and its stability analysis
Uses Software
This page was built for publication: A neurodynamic optimization approach for complex-variables programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055053)
