Cart (Loading....) | Create Account
Close category search window
 

Convergence analysis of discrete-time simplified dual neural network for solving convex quadratic programming problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lu Yang ; Dept. of Autom., Shanghai Jiao Tong Univ., Shanghai, China ; Li Dewei ; Xi Yugeng ; Lu Jianbo

The convergence property of discrete-time simplified dual neural network for convex quadratic programming is investigated. By choosing a proper Lyapunov function, a sufficient condition for global convergence is obtained. The convergence rate under the condition is also analyzed, and the exponential convergence property under the condition is proved. Simulation verifies the validity of the theoretical results obtained in this paper.

Published in:

Control Conference (CCC), 2012 31st Chinese

Date of Conference:

25-27 July 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.