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

A range-space method for piecewise-linear quadratic programming: an application to optimal control algorithms

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

1 Author(s)
Pytlak, R. ; Centre for Process Syst. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK

A new method for solving a convex optimization problem with box constraints is presented. The objective function has a positive-definite quadratic term and a piecewise-linear term. The method is derived from a range space method for QP problems. The approach is particularly efficient if the piecewise-linear term has few breakpoints. Numerical comparisons with an efficient implementation of a null-space active-set algorithm (LSSOL) are also presented

Published in:

Decision and Control, 1994., Proceedings of the 33rd IEEE Conference on  (Volume:2 )

Date of Conference:

14-16 Dec 1994

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.