ZFD formula 4IgSFD\_Y applied to future minimization
From MaRDI portal
Publication:1680199
Recommendations
- Four discrete-time ZD algorithms for dynamic linear matrix-vector inequality solving
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- Zames-Falb Multipliers for Quadratic Programming
- An iterative minimization formulation for saddle point search
- Publication:4889424
- scientific article; zbMATH DE number 5060006
- scientific article; zbMATH DE number 915951
- Solving future equation systems using integral-type error function and using twice ZNN formula with disturbances suppressed
- Sigma-subdifferential and its application to minimization problem
Cites work
- A direct search approach to optimization for nonlinear model predictive control
- An exact penalty function method for nonlinear mixed discrete programming problems
- Data clustering and visualization via energy minimization
- Designing neural networks that process mean values of random variables
- From Zhang Neural Network to Newton Iteration for Matrix Inversion
- Learning-induced pattern classification in a chaotic neural network
- Pattern recognition minimizes entropy production in a neural network of electrical oscillators
- Synchronized stability in a reaction-diffusion neural network model
- Taylor-type 1-step-ahead numerical differentiation rule for first-order derivative approximation and ZNN discretization
- Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration
- Two-dimensional capillary origami
- Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints
Cited in
(9)- Solving future equation systems using integral-type error function and using twice ZNN formula with disturbances suppressed
- New zeroing neural dynamics models for diagonalization of symmetric matrix stream
- Time-varying matrix eigenanalyses via Zhang neural networks and look-ahead finite difference equations
- Discrete-time Zhang neural networks for time-varying nonlinear optimization
- From mathematical equivalence such as Ma equivalence to generalized Zhang equivalency including gradient equivalency
- Stepsize domain confirmation and optimum of zead formula for future optimization
- New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern
- Four discrete-time ZD algorithms for dynamic linear matrix-vector inequality solving
- The construction of high order convergent look-ahead finite difference formulas for Zhang neural networks
This page was built for publication: ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680199)