Lagrange Programming Neural Network for Nondifferentiable Optimization Problems in Sparse Approximation

doi:10.1109/TNNLS.2016.2575860

Return

Lagrange Programming Neural Network for Nondifferentiable Optimization Problems in Sparse Approximation

2017-10-01

PRE

DOI：10.1109/TNNLS.2016.2575860

Original

Original request for help

Save

Abstract

En 中文

The major limitation of the Lagrange programming neural network (LPNN) approach is that the objective function and the constraints should be twice differentiable. Since sparse approximation involves nondifferentiable functions, the original LPNN approach is not suitable for recovering sparse signals. This paper proposes a new formulation of the LPNN approach based on the concept of the locally competitive algorithm (LCA). Unlike the classical LCA approach which is able to solve unconstrained optimization problems only, the proposed LPNN approach is able to solve the constrained optimization problems. Two problems in sparse approximation are considered. They are basis pursuit (BP) and constrained BP denoise (CBPDN). We propose two LPNN models, namely, BP-LPNN and CBPDN-LPNN, to solve these two problems. For these two models, we show that the equilibrium points of the models are the optimal solutions of the two problems, and that the optimal solutions of the two problems are the equilibrium points of the two models. Besides, the equilibrium points are stable. Simulations are carried out to verify the effectiveness of these two LPNN models.

Keywords:

Lagrange programming neural networks (LPNNs)

locally competitive algorithm (LCA)

optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.