By Topic

Solving nonconvex optimization 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
$33 $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)
D. Henrion ; LAAS-CNRS, Toulouse, France ; J. -B. Lasserre

It is well known that most analysis and design problems in robust and nonlinear control can be formulated as global optimization problems with polynomial objective functions and constraints. The objective of this article is to show how GloptiPoly can solve challenging nonconvex optimization problems in robust nonlinear control. GloptiPoly is a general-purpose software with a user-friendly interface. First, we describe several nonconvex optimization problems arising in control system analysis and design. These problems involve multivariable polynomial objective functions and constraints. We then review the theoretical background behind GloptiPoly. Next, an example is presented to illustrate the successive linear matrix inequality relaxations and general features of the GloptiPoly software. Finally, we apply GloptiPoly to several control-related problems.

Published in:

IEEE Control Systems  (Volume:24 ,  Issue: 3 )