Skip to main navigation Skip to search Skip to main content

A recurrent neural network for non-smooth convex programming subject to linear equality and bound constraints

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

In this paper, a recurrent neural network model is proposed for solving non-smooth convex programming problems, which is a natural extension of the previous neural networks. By using the non-smooth analysis and the theory of differential inclusions, the global convergence of the equilibrium is analyzed and proved. One simulation example shows the convergence of the presented neural network. © Springer-Verlag Berlin Heidelberg 2006.
Original languageEnglish
Title of host publicationNeural Information Processing
Subtitle of host publication13th International Conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006, Proceedings, Part II
EditorsIrwin King, Jun Wang, Lai-Wan Chan
Place of PublicationBerlin, Heidelberg
PublisherSpringer 
Pages1004-1013
ISBN (Electronic)978-3-540-46482-2
ISBN (Print)9783540464815
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event13th International Conference on Neural Information Processing (ICONIP 2006) - Hong Kong, China
Duration: 3 Oct 20066 Oct 2006

Publication series

NameLecture Notes in Computer Science
Volume4233
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on Neural Information Processing (ICONIP 2006)
PlaceChina
CityHong Kong
Period3/10/066/10/06

Fingerprint

Dive into the research topics of 'A recurrent neural network for non-smooth convex programming subject to linear equality and bound constraints'. Together they form a unique fingerprint.

Cite this