A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints

DOI10.1016/J.CHAOS.2016.03.009zbMATH Open1355.90066OpenAlexW2298471421MaRDI QIDQ508218FDOQ508218

Authors: Mi Zhou, Xiaolan Liu 

Publication date: 10 February 2017

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2016.03.009

Recommendations

• A one-layer recurrent neural network for constrained nonconvex optimization
• A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
• Neural network for nonsmooth pseudoconvex optimization with general convex constraints
• Neural network for constrained nonsmooth optimization using Tikhonov regularization
• A recurrent neural network for solving a class of generalized convex optimization problems

zbMATH Keywords

lower boundsfinite-time convergenceneural networknon-smooth analysislinear inequality constraints

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Further results on global convergence and stability of globally projected dynamical systes
• Lagrange programming neural networks
• Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
• A projection neural network and its application to constrained optimization problems
• A high performance neural network for solving nonlinear programming problems with hybrid constraints
• On the stability of globally projected dynamical systems
• On saddle points and optima for non-smooth and non-convex programs
• Solving complementarity and variational inequalities problems using neural networks
• A deterministic annealing neural network for convex programming
• Analysis and design of a recurrent neural network for linear programming
• A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming
• Numerical solutions for constrained quadratic problems using high-performance neural networks
• An Extended Projection Neural Network for Constrained Optimization

Cited In (11)

• A differential inclusion-based approach for solving nonsmooth convex optimization problems
• An Interior Point Recurrent Neural Network for Convex Optimization Problems
• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems
• A one-layer recurrent neural network for constrained nonconvex optimization
• A one-layer recurrent neural network for constrained nonsmooth invex optimization
• Neural network for nonsmooth pseudoconvex optimization with general convex constraints
• A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints
• A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
• A Cooperative Recurrent Neural Network for Solving L₁ Estimation Problems with General Linear Constraints
• A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints

This page was built for publication: A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints

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