Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

An Efficient Algorithm for Multiparametric Quadratic Programming

Author(s):

M. Baotic
Conference/Journal:

vol. AUT02-05
Abstract:

We present an efficient algorithm for multiparametric quadratic programming (mp-QP). As in~cite{BMDP02a}, Karush-Kuhn-Tucker (KKT) conditions are used to characterize polyhedral critical regions and corresponding optimal solution. However, here we avoid unnecessary partitioning of the parameter space by using direct exploration strategy. Starting from the initial critical region we explore its neighborhood by crossing each of facets and checking if a feasible neighboring critical region exists. Procedure is then repeated in an iterative fashion with all newly generated regions.

Further Information
Year:

2002
Type of Publication:

(04)Technical Report
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@TechReport { Xxx:2002:IFA_67,
    author={M. Baotic},
    title={{An Efficient Algorithm for Multiparametric Quadratic
	  Programming}},
    institution={},
    year={2002},
    number={},
    address={},
    month=apr,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=67}
}
Permanent link