By Topic

Algorithm for variational inequality problems based on a gradient dynamical system designed using a control Liapunov function

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

2 Author(s)
Pazos, F.A. ; COPPE/UFRJ, Rio de Janeiro ; Bhaya, Amit

We present an algorithm to find the optimal point of a variational inequality problem. The domain of the function that defines the variational inequality is a convex set, determined by convex inequality constraints and affine equality constraints. The algorithm is based on a discrete variable structure closed-loop control system which presents sliding mode trajectories on the boundary of the feasible set until the optimal point is reached. The update law is designed using control Liapunov function (CLF), which guarantees the decrease of a discrete Liapunov function inside and outside the feasible set. The step size is optimized using Liapunov optimizing control (LOC).

Published in:

Intelligent Control, 2007. ISIC 2007. IEEE 22nd International Symposium on

Date of Conference:

1-3 Oct. 2007