Four discrete-time ZD algorithms for dynamic linear matrix-vector inequality solving

DOI10.2298/FIL2015103XzbMath1499.15061MaRDI QIDQ5082442

No author found.

Publication date: 16 June 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

Zhang dynamicsdiscrete-time algorithmsnumerical verificationsdifference rulesdynamic linear matrix-vector inequality

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Algorithms with automatic result verification (65G20)

Cites Work

• Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
• ZNN for solving online time-varying linear matrix-vector inequality via equality conversion
• Stability of discrete time recurrent neural networks and nonlinear optimization problems
• ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization
• Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application
• Taylor-type 1-step-ahead numerical differentiation rule for first-order derivative approximation and ZNN discretization
• Dynamic design, numerical solution and effective verification of acceleration-level obstacle-avoidance scheme for robot manipulators
• Recurrent neural networks for solving linear inequalities and equations
• A new variant of the Zhang neural network for solving online time-varying linear inequalities

This page was built for publication: Four discrete-time ZD algorithms for dynamic linear matrix-vector inequality solving