A Discrete-Time Projection Neural Network for Solving Degenerate Convex Quadratic Optimization
This paper presents a discrete-time neural network to solve convex degenerate quadratic optimization problems. Under certain conditions, it is shown that the proposed neural network is stable in the sense of Lyapunov and globally convergent to an optimal solution. Compared with the existing continuo...
Gespeichert in:
Veröffentlicht in: | Circuits, systems, and signal processing systems, and signal processing, 2017, Vol.36 (1), p.389-403 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper presents a discrete-time neural network to solve convex degenerate quadratic optimization problems. Under certain conditions, it is shown that the proposed neural network is stable in the sense of Lyapunov and globally convergent to an optimal solution. Compared with the existing continuous-time neural networks for degenerate quadratic optimization, the proposed neural network in this paper is more suitable for hardware implementation. Results of two experiments of this neural network are given to illustrate the effectiveness of the proposed neural network. |
---|---|
ISSN: | 0278-081X 1531-5878 |
DOI: | 10.1007/s00034-016-0308-5 |