2002
DOI: 10.1007/s005210200022
|View full text |Cite
|
Sign up to set email alerts
|

A Neural Network for Solving Nonlinear Programming Problems

Abstract: A neural network for solving convex nonlinear programming problems is proposed in this paper. The distinguishing features of the proposed network are that the primal and dual problems can be solved simultaneously, all necessary and sufficient optimality conditions are incorporated, and no penalty parameter is involved. Based on Lyapunov, LaSalle and set stability theories, we prove strictly an important theoretical result that, for an arbitrary initial point, the trajectory of the proposed network does converg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
7
0

Year Published

2002
2002
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(9 citation statements)
references
References 22 publications
0
7
0
Order By: Relevance
“…Employing (1) and using (12)- (14), the FP problem (10) and (11) is modified into an equivalent CSOCP as…”
Section: Casementioning
confidence: 99%
“…Employing (1) and using (12)- (14), the FP problem (10) and (11) is modified into an equivalent CSOCP as…”
Section: Casementioning
confidence: 99%
“…Given the strong ability of approximation, neural network (NN) has been utilized by some researchers to solve the nonlinear optimization (NLP) problem. In the work of Chen et al, 47 NN is proposed for solving convex nonlinear programming problems. Additionally, Xue et al 48 construct a project NN for solving degenerate quadratic programming problems with general linear constraints.…”
Section: Introductionmentioning
confidence: 99%
“…In fact, there have been various types of neural networks proposed for solving linear programming, nonlinear programming, variational inequalities, etc., we cite for example [7][8][9][10][11][12][13].…”
Section: Introductionmentioning
confidence: 99%