Skip to Main Content
Article navigation
Purpose

It is desired to provide a diversified iterative scheme for solving the constrained solutions of the generalized coupled discrete-time periodic (GCDTP) matrix equations from the perspective of optimization.

Design/methodology/approach

The paper considers generalized reflexive solutions of the GCDTP matrix equations by applying the Jacobi gradient-based iterative (JGI) algorithm, which is an extended variant of the gradient-based iterative (GI) algorithm.

Findings

Through numerical simulation, it is verified that the efficiency and accuracy of the JGI algorithm are better than some existing algorithms, such as the GI algorithm in Hajarian, the RGI algorithm in Sheng and the AGI algorithm in Xie and Ma.

Originality/value

It is the first instance in which the GCDTP matrix equations are solved applying the JGI algorithm.

Licensed re-use rights only
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Please enter valid email address.
Email address must be 94 characters or fewer.
Pay-Per-View Access
$41.00
Rental

or Create an Account

Close Modal
Close Modal