Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity

DOI10.1109/TCSI.2012.2209735zbMath1468.90081OpenAlexW2061309766MaRDI QIDQ5008482

Wei Bian, Xiao-Ping 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)

Related Items (9)

Neural network for nonsmooth pseudoconvex optimization with general convex constraints ⋮ A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem ⋮ A one-layer recurrent neural network for constrained nonconvex optimization ⋮ Neural network for constrained nonsmooth optimization using Tikhonov regularization ⋮ Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints ⋮ A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization ⋮ 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 ⋮ A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints

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