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

DOI10.2298/FIL2015103XMaRDI QIDQ5082442zbMATH OpenFDO

Authors

Publication date 16 June 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL2015103X

zbMATH Keywords

difference rulesdiscrete-time algorithmsdynamic linear matrix-vector inequalitynumerical verificationsZhang dynamics

Mathematics Subject Classification ID

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

Recommendations

• Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
• Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
• General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
• Solving time-varying nonlinear inequalities using continuous and discrete-time Zhang dynamics
• Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities
• The \(D\)-decomposition technique for linear matrix inequalities
• ZNN for solving online time-varying linear matrix-vector inequality via equality conversion
• scientific article; zbMATH DE number 4066722
• A splitting iterative method for the discrete dynamic linear systems

Cites work

• A new variant of the Zhang neural network for solving online time-varying linear inequalities
• Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
• 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
• Stability of discrete time recurrent neural networks and nonlinear optimization problems
• Taylor-type 1-step-ahead numerical differentiation rule for first-order derivative approximation and ZNN discretization
• Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application
• ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization
• ZNN for solving online time-varying linear matrix-vector inequality via equality conversion

Cited in

(1)

• ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization

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

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