A neural network for constrained saddle point problems: An approximation approach

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a neural network for saddle point problems(SPP) by an approximation approach. It first proves both the existence and the convergence property of approximate solutions, and then shows that the proposed network is globally exponentially stable and the solution of (SPP) is approximated. Simulation results are given to demonstrate further the effectiveness of the proposed network. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Shen, X., Song, S., & Cheng, L. (2005). A neural network for constrained saddle point problems: An approximation approach. In Lecture Notes in Computer Science (Vol. 3610, pp. 470–475). Springer Verlag. https://doi.org/10.1007/11539087_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free