A one-layer recurrent neural network for constrained nonconvex optimization
From MaRDI portal
Publication:889340
DOI10.1016/j.neunet.2014.09.009zbMath1325.90103OpenAlexW2997320126WikidataQ51001423 ScholiaQ51001423MaRDI QIDQ889340
Jun Wang, Guocheng Li, Zheng Yan
Publication date: 6 November 2015
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2014.09.009
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (21)
A Dynamical Splitting Method for Minimizing the Sum of Three Convex Functions ⋮ Neural network for nonsmooth pseudoconvex optimization with general convex constraints ⋮ 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 neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem ⋮ Two-timescale recurrent neural networks for distributed minimax optimization ⋮ An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games ⋮ 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 ⋮ Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ An event-triggered collaborative neurodynamic approach to distributed global optimization ⋮ An inertial subgradient-extragradient algorithm for solving pseudomonotone variational inequalities ⋮ Two-timescale projection neural networks in collaborative neurodynamic approaches to global optimization and distributed optimization ⋮ 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 ⋮ Finite-time synchronization of delayed fractional-order quaternion-valued memristor-based neural networks
Cites Work
- Unnamed Item
- Unnamed Item
- A dynamic system model for solving convex nonlinear optimization problems
- 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
- Generalized convexity and optimization. Theory and applications
- ``Neural computation of decisions in optimization problems
- A deterministic annealing neural network for convex programming
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- On the dynamics of a differential inclusion built upon a nonconvex constrained minimization problem
- A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
- An analysis of a class of neural networks for solving linear programming problems
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Exact Penalty Functions in Constrained Optimization
- Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity
- A projection neural network and its application to constrained optimization problems
- Global convergence analysis of Lagrangian networks
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: A one-layer recurrent neural network for constrained nonconvex optimization
