Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
DOI10.1007/S11075-017-0302-4zbMATH Open1382.65174OpenAlexW2598417513MaRDI QIDQ679697FDOQ679697
Zhaozhu Su, Zhijing Huang, Sibo Sun, Xinjie Lin, Dong-Sheng Guo
Publication date: 19 January 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0302-4
consistencynumerical resultsnumerical verificationZhang dynamicsdiscrete-time algorithmsthree-step iterationtime-varying nonlinear minimizationzero-stability
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- Impulsive control for continuous-time Markov decision processes: a linear programming approach
- A model-hybrid approach for unconstrained optimization problems
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Stability of discrete time recurrent neural networks and nonlinear optimization problems
- Numerical Methods for Ordinary Differential Equations
- A hybrid PSO-GA algorithm for constrained optimization problems
- 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
- A line search exact penalty method with bi-object strategy for nonlinear constrained optimization
Cited In (16)
- Discrete-time Euler-smoothing methods for time-varying convex constrained optimization
- Relationship between time-instant number and precision of ZeaD formulas with proofs
- General 9-instant discrete-time Zhang neural network for time-dependent applications
- General five-step discrete-time Zhang neural network for time-varying nonlinear optimization
- Four discrete-time ZD algorithms for dynamic linear matrix-vector inequality solving
- A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
- New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern
- Stepsize domain confirmation and optimum of zead formula for future optimization
- Modified Newton integration algorithm with noise suppression for online dynamic nonlinear optimization
- Noise-tolerant continuous-time Zhang neural networks for time-varying Sylvester tensor equations
- Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
- Discrete-time noise-tolerant Z-type model for online solving nonlinear time-varying equations in the presence of noises
- Discrete-time Zhang neural networks for time-varying nonlinear optimization
- General six-step discrete-time Zhang neural network for time-varying tensor absolute value equations
- New zeroing neural dynamics models for diagonalization of symmetric matrix stream
- Tracking control of ship course system using new six-step zead (Zhang et al discretization) formula with high precision
This page was built for publication: Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679697)
