A Discrete-time Neural Network for Solving Convex Optimization Problem in Support Vector Machine
This paper proposes a discrete-time neural network model to solve the convex optimization problem deduced by a positive-kernel-based support vector machine ( SVM) . First，the projection equations are constructed through the Karush-Kuhn-Tucker ( KKT) conditions and projection theory so that there exi...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Harbin University of Science and Technology Publications
2018-08-01
|
| Series: | Journal of Harbin University of Science and Technology |
| Subjects: | |
| Online Access: | https://hlgxb.hrbust.edu.cn/#/digest?ArticleID=1571 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|