Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
type: Item
instance of: scholarly article
title: Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
zbMATH Open document ID: 1382.65174
author: Xinjie Lin
author: Zhaozhu Su
author: Sibo Sun
author: Zhijing Huang
author: Dong-Sheng Guo
published in: Numerical Algorithms
publication date: 2018-01-19T00:00:00Z
review text: The authors propose two types of discrete-time Zhang dynamics algorithms for time-varying nonlinear minimizaion by utilizing two types of Taylor-type difference rules, each of which is a three-step iteration. Based on the concepts of zero-stability and consistency, some theoretical results are presented to show the computational property of the proposed algorithms. The efficiency of the algorithms are illustrated by some numerical results.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6827913
zbMATH Keywords: discrete-time algorithms
zbMATH Keywords: time-varying nonlinear minimization
zbMATH Keywords: numerical verification
zbMATH Keywords: Zhang dynamics
zbMATH Keywords: three-step iteration
zbMATH Keywords: zero-stability
zbMATH Keywords: consistency
zbMATH Keywords: numerical results
MaRDI profile type: Publication
full work available at URL: s11075-017-0302-4
OpenAlex ID: W2598417513
cites work: An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
cites work: Impulsive control for continuous-time Markov decision processes: a linear programming approach
cites work: Dynamic design, numerical solution and effective verification of acceleration-level obstacle-avoidance scheme for robot manipulators
cites work: An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
cites work: A model-hybrid approach for unconstrained optimization problems
cites work: Q3932576
cites work: Q4821526
cites work: Numerical Optimization
cites work: A line search exact penalty method with bi-object strategy for nonlinear constrained optimization
cites work: A hybrid PSO-GA algorithm for constrained optimization problems
cites work: Stability of discrete time recurrent neural networks and nonlinear optimization problems
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
cites work: Q4692495
cites work: Taylor-type 1-step-ahead numerical differentiation rule for first-order derivative approximation and ZNN discretization
cites work: Numerical Methods for Ordinary Differential Equations
DOI: 10.1007/S11075-017-0302-4
description: scientific article; zbMATH DE number 6827913