東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Solving variational inequalities and...

Hu, Xiaolin.

Linked to FindBook

Google Book

Amazon

博客來

Solving variational inequalities and related problems using recurrent neural networks.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Solving variational inequalities and related problems using recurrent neural networks./
Author:	Hu, Xiaolin.
Description:	207 p.
Notes:	Adviser: Jun Wang.
Contained By:	Dissertation Abstracts International69-02B.
Subject:	Artificial Intelligence. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3302428
ISBN:	9780549483854

Solving variational inequalities and related problems using recurrent neural networks.
Hu, Xiaolin.

Solving variational inequalities and related problems using recurrent neural networks. - 207 p.

Adviser: Jun Wang.

Thesis (Ph.D.)--The Chinese University of Hong Kong (Hong Kong), 2007.

Variational inequality (VI) can be viewed as a natural framework for unifying the treatment of equilibrium problems, and hence has applications across many disciplines. In addition, many typical problems are closely related to VI, including general VI (GVI), complementarity problem (CP), generalized CP (GCP) and optimization problem (OP).

ISBN: 9780549483854Subjects--Topical Terms:

769149
Artificial Intelligence.

Solving variational inequalities and related problems using recurrent neural networks.
LDR:03098nam 2200301 a 45 001 959017
005 20110704
008 110704s2007 ||||||||||||||||| ||eng d
020 $a 9780549483854
035 $a (UMI)AAI3302428
035 $a AAI3302428
040 $a UMI $c UMI
100 1 $a Hu, Xiaolin. $3 1282485
245 1 0 $a Solving variational inequalities and related problems using recurrent neural networks.
300 $a 207 p.
500 $a Adviser: Jun Wang.
500 $a Source: Dissertation Abstracts International, Volume: 69-02, Section: B, page: 1102.
502 $a Thesis (Ph.D.)--The Chinese University of Hong Kong (Hong Kong), 2007.
520 $a Variational inequality (VI) can be viewed as a natural framework for unifying the treatment of equilibrium problems, and hence has applications across many disciplines. In addition, many typical problems are closely related to VI, including general VI (GVI), complementarity problem (CP), generalized CP (GCP) and optimization problem (OP).
520 $a During the past two decades, numerous recurrent neural networks (RNNs) have been proposed for solving VIs and related problems. However, first, the theories of many emerging RNNs have not been well founded yet; and their capabilities have been underestimated. Second, these RNNs have limitations in handling some types of problems. Third, it is certainly not true that these RNNs are best choices for solving all problems, and new network models with more favorable characteristics could be devised for solving specific problems.
520 $a In the research, the above issues are extensively explored from dynamic system perspective, which leads to the following major contributions. On one hand, many new capabilities of some existing RNNs have been revealed for solving VIs and related problems. On the other hand, several new RNNs have been invented for solving some types of these problems. The contributions are established on the following facts. First, two existing RNNs, called TLPNN and PNN, are found to be capable of solving pseudomonotone VIs and related problems with simple bound constraints. Second, many more stability results are revealed for an existing RNN, called GPNN, for solving GVIs with simple bound constraints, and it is then extended to solve linear VIs (LVIs) and generalized linear VIs (GLVIs) with polyhedron constraints. Third, a new RNN, called IDNN, is proposed for solving a special class of quadratic programming problems which features lower structural complexity compared with existing RNNs. Fourth, some local convergence results of an existing RNN, called EPNN, for nonconvex optimization are obtained, and two variants of the network by incorporating two augmented Lagrangian function techniques are proposed for seeking Karush-Kuhn-Tucker (KKT) points, especially local optima, of the problems.
590 $a School code: 1307.
650 4 $a Artificial Intelligence. $3 769149
650 4 $a Computer Science. $3 626642
690 $a 0800
690 $a 0984
710 2 $a The Chinese University of Hong Kong (Hong Kong). $3 1017547
773 0 $t Dissertation Abstracts International $g 69-02B.
790 $a 1307
790 1 0 $a Wang, Jun, $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3302428