Abstract

In recent years, matrix-valued optimization algorithms have been studied to enhance the computational performance of vector-valued optimization algorithms. This paper presents two matrix-type projection neural networks, continuous-time and discrete-time ones, for solving matrix-valued optimization problems. The proposed continuous-time neural network may be viewed as a significant extension to the vector-type double projection neural network. More importantly, the proposed discrete-time projection neural network is suitable for parallel implementation in terms of matrix state spaces. Under pseudo-monotonicity and Lipschitz continuous conditions, the proposed two matrix-type projection neural networks are guaranteed to be globally convergent to the optimal solution. Finally, the proposed matrix-type projection neural network is effectively applied to image restoration. Computed examples show that the two proposed matrix-type projection neural networks are much superior to the vector-type projection neural networks in terms of computation speed.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.