A novel method to handle inequality constraints for convex programming neural network

DOI10.1023/A:1019795625435zbMath1008.68757OpenAlexW1519277949MaRDI QIDQ1857753

Huang Yuancan

Publication date: 19 February 2003

Published in: Neural Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019795625435

zbMATH Keywords

stabilityneural networkconvex programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

A dynamic system model for solving convex nonlinear optimization problems

This page was built for publication: A novel method to handle inequality constraints for convex programming neural network