Robustness of convergence in finite time for linear programming neural networks

DOI10.1002/CTA.352MaRDI QIDQ3425464zbMATH OpenOpenAlexFDO

Authors Marco Di Mauro, Mauro Forti, Massimo Grazzini

Publication date 22 February 2007

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.352

zbMATH Keywords

convergencelinear programmingneural networksrobustness

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An analysis of a class of neural networks for solving linear programming problems
• A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
• A neural network for nonlinear programming with linear constraints
• A new neural network for solving linear programming problems
• On complete stability of linear and quadratic programming neural networks

Cited in

(4)

• Robust linear neural network for constrained quadratic optimization
• A new design formula exploited for accelerating Zhang neural network and its application to time-varying matrix inversion
• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• An analysis of a class of neural networks for solving linear programming problems

This page was built for publication: Robustness of convergence in finite time for linear programming neural networks

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