On complete stability of linear and quadratic programming neural networks

DOI10.1002/CTA.209MaRDI QIDQ4406074zbMATH OpenOpenAlexFDO

Authors Mauro Forti

Publication date 25 June 2003

Published in International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cta.209

zbMATH Keywords

complete stabilityneural networksprogramming problems

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Neural networks for/in biological studies, artificial life and related topics (92B20) Analytic circuit theory (94C05)

Recommendations

• A nonlinear projection neural network for solving interval quadratic programming problems and its stability analysis
• New conditions for global stability of neural networks with application to linear and quadratic programming problems
• A neural network for nonlinear programming with linear constraints
• scientific article; zbMATH DE number 1497340

Cited in

(4)

• Robustness of convergence in finite time for linear programming neural networks
• scientific article; zbMATH DE number 5631726 (Why is no real title available?)
• New conditions for global stability of neural networks with application to linear and quadratic programming problems
• Stability of an analog optimization circuit for quadratic programming

This page was built for publication: On complete stability of linear and quadratic programming neural networks

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