Skip to main navigation Skip to search Skip to main content

Lagrange Programming Neural Network for the l1-norm Constrained Quadratic Minimization

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

Abstract

The Lagrange programming neural network (LPNN) is a framework for solving constrained nonlinear programm problems. But it can solve differentiable objective/contraint functions only. As the l1-norm constrained quadratic minimization (L1CQM), one of the sparse approximation problems, contains the nondifferentiable constraint, the LPNN cannot be used for solving L1CQM. This paper formulates a new LPNN model, based on introducing hidden states, for solving the L1CQM problem. Besides, we discuss the stability properties of the new LPNN model. Simulation shows that the performance of the LPNN is similar to that of the conventional numerical method. © Springer International Publishing Switzerland 2015.
Original languageEnglish
Title of host publicationNeural Information Processing - 22nd International Conference, ICONIP 2015, Proceedings
Editors Sabri Arik, Tingwen Huang, Weng Kin Lai, Qingshan Liu
PublisherSpringer, Cham
Pages119-126
VolumePart III
ISBN (Electronic)9783319265551
ISBN (Print)9783319265544
DOIs
Publication statusPublished - 2015
Event22nd International Conference on Neural Information Processing (ICONIP 2015) - Istanbul, Türkiye
Duration: 9 Nov 201512 Nov 2015

Publication series

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

Conference

Conference22nd International Conference on Neural Information Processing (ICONIP 2015)
PlaceTürkiye
CityIstanbul
Period9/11/1512/11/15

Research Keywords

  • Stability
  • Sparse approximation
  • LPNN

Fingerprint

Dive into the research topics of 'Lagrange Programming Neural Network for the l1-norm Constrained Quadratic Minimization'. Together they form a unique fingerprint.

Cite this