A one-layer recurrent neural network for constrained nonsmooth invex optimization

DOI10.1016/j.neunet.2013.11.007zbMath1298.90077OpenAlexW4248996067WikidataQ51137309 ScholiaQ51137309MaRDI QIDQ470180

Guocheng Li, Zheng Yan, Jun Wang

Publication date: 12 November 2014

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2013.11.007

zbMATH Keywords

recurrent neural networkexact penalty functionfinite time convergenceinvex optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items (13)

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 collaborative neurodynamic approach to global and combinatorial optimization ⋮ A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem ⋮ A one-layer recurrent neural network for constrained nonconvex optimization ⋮ Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization ⋮ A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ Neural network for a class of sparse optimization with \(L_0\)-regularization ⋮ A neurodynamic optimization approach to supervised feature selection via fractional programming ⋮ A neurodynamic approach to convex optimization problems with general constraint ⋮ Invex programming problems with equality and inequality constraints ⋮ A collective neurodynamic optimization approach to bound-constrained nonconvex optimization

Cites Work

• 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
• ``Neural computation of decisions in optimization problems
• On sufficiency of the Kuhn-Tucker conditions
• A deterministic annealing neural network for convex programming
• Generalized convexity of functions and generalized monotonicity of set-valued maps
• What is invexity?
• Lagrange programming neural networks
• Analysis and design of a recurrent neural network for linear programming
• An analysis of a class of neural networks for solving linear programming problems
• Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
• Generalized gradient projection neural networks for nonsmooth optimization problems
• A projection neural network and its application to constrained optimization problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Fractional Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A one-layer recurrent neural network for constrained nonsmooth invex optimization