A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints

DOI10.1016/J.CNSNS.2013.08.034MaRDI QIDQ2299749zbMATH OpenOpenAlexFDO

Authors Sitian Qin, Dejun Fan, Peng Su, Qinghe Liu

Publication date 24 February 2020

Published in Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cnsns.2013.08.034

zbMATH Keywords

global convergencepseudoconvex programmingrecurrent neural network

Mathematics Subject Classification ID

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

Recommendations

• A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
• Neural network for nonsmooth pseudoconvex optimization with general convex constraints
• A recurrent neural network for solving a class of generalized convex optimization problems
• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints

Cites work

• A class of combined iterative methods for solving variational inequalities
• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• A projection neural network and its application to constrained optimization problems
• A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
• Dynamical Analysis of Neural Networks of Subgradient System
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3716008 (Why is no real title available?)
• scientific article; zbMATH DE number 5053484 (Why is no real title available?)
• Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity
• New minimax algorithm
• On the entropic regularization method for solving min-max problems with applications
• Seven kinds of monotone maps
• Test examples for nonlinear programming codes
• The optimization technique for solving a class of non-differentiable programming based on neural network method

Cited in

(11)

• A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
• A novel neural network to nonlinear complex-variable constrained nonconvex optimization
• A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
• A projection neural network with time delays for solving linear variational inequality problems and its applications
• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• An Interior Point Recurrent Neural Network for Convex Optimization Problems
• Dynamical Behavior of Cooperative Supportive System Involving Intra-Network Delays in Information Propagation
• A Cooperative Recurrent Neural Network for Solving L₁ Estimation Problems with General Linear Constraints
• Neurodynamic optimization algorithm for split equality problems and application to sparse signal recovery
• Fixed-time neurodynamic optimization approach with time-varying coefficients to variational inequality problems and applications
• Integration-enhanced zeroing neural network for temporally-variant quadratic programming involving inequality constraints

This page was built for publication: A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299749)