Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity

DOI10.1109/TCSI.2012.2209735MaRDI QIDQ5008482zbMATH OpenOpenAlexFDO

Authors Wei Bian, Xiaoping Xue

Publication date 26 August 2021

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2012.2209735

Mathematics Subject Classification ID

Convex programming (90C25)

Cited in

(12)

• A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
• Model building and optimization analysis of MDF continuous hot-pressing process by neural network
• Neural network for nonsmooth pseudoconvex optimization with general convex constraints
• A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
• A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
• Ω-GLOBALLY ATTRACTIVE EQUILIBRIUM POINTS OF THE CNN
• scientific article; zbMATH DE number 7108981 (Why is no real title available?)
• Smoothing neural network for L₀ regularized optimization problem with general convex constraints
• Efficient Construction of Neural Networks Lyapunov Functions with Domain of Attraction Maximization
• A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization
• A one-layer recurrent neural network for constrained nonconvex optimization
• Neural network for constrained nonsmooth optimization using Tikhonov regularization

This page was built for publication: Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity

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