By Topic

Long step path-following algorithm for the convex quadratic programming in a Hilbert space

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)
Faybusovich, L. ; Dept. of Math., Notre Dame Univ., IN, USA ; Moore, J.B.

We develop an interior-point technique for solving quadratic programming problem in a Hilbert space. As an example we consider an application of these results to the linear-quadratic control problem with linear inequality constraints. It is shown that the Newton step in this situation is basically reduced to solving the standard linear-quadratic control problem

Published in:

Decision and Control, 1995., Proceedings of the 34th IEEE Conference on  (Volume:2 )

Date of Conference:

13-15 Dec 1995