A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
From MaRDI portal
Publication:2339416
DOI10.1016/j.neunet.2014.03.006zbMath1308.90137DBLPjournals/nn/Yan0L14OpenAlexW2005122474WikidataQ50672451 ScholiaQ50672451MaRDI QIDQ2339416
Zheng Yan, Guocheng Li, Jun Wang
Publication date: 1 April 2015
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2014.03.006
Nonconvex programming, global optimization (90C26) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items (21)
Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique ⋮ A non-penalty recurrent neural network for solving a class of constrained optimization problems ⋮ A nonnegative matrix factorization algorithm based on a discrete-time projection neural network ⋮ A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints ⋮ A collaborative neurodynamic approach to global and combinatorial optimization ⋮ A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints ⋮ A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems ⋮ Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization ⋮ Collaborative neurodynamic optimization for solving nonlinear equations ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines ⋮ Neurodynamic approaches for sparse recovery problem with linear inequality constraints ⋮ A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization ⋮ A neurodynamic optimization approach to supervised feature selection via fractional programming ⋮ A Discrete-Time Neurodynamic Approach to Sparsity-Constrained Nonnegative Matrix Factorization ⋮ A neurodynamic optimization technique based on overestimator and underestimator functions for solving a class of non-convex optimization problems ⋮ A novel neural network to nonlinear complex-variable constrained nonconvex optimization ⋮ Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network ⋮ Collective neurodynamic optimization for economic emission dispatch problem considering valve point effect in microgrid ⋮ On the global exponential stability of a projected dynamical system for strongly pseudomonotone variational inequalities ⋮ Neurodynamical classifiers with low model complexity
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 recurrent neural network for solving a class of generalized convex optimization problems
- A one-layer recurrent neural network for constrained nonsmooth invex optimization
- ``Neural computation of decisions in optimization problems
- A deterministic annealing neural network for convex programming
- Neurodynamical optimization
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- Lagrange programming neural networks
- A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- A projection neural network and its application to constrained optimization problems
- A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming
This page was built for publication: A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
