| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4635948 | Applied Mathematics and Computation | 2007 | 12 Pages |
Abstract
In this paper we present that solution of convex programming problems is equivalent with solution of projection formulation, then we introduce neural network models for solving projection formulation and analysis stability conditions and convergence. Simulation shows that the introduced neural network is effective in solving convex programming problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
S. Effati, A. Ghomashi, A.R. Nazemi,