Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity

DOI10.1109/TCSI.2012.2209735zbMATH Open1468.90081OpenAlexW2061309766MaRDI QIDQ5008482FDOQ5008482

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)

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

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)