Results 1 
5 of
5
Method of centers for minimizing generalized eigenvalues
 Linear Algebra Appl
, 1993
"... We consider the problem of minimizing the largest generalized eigenvalue of a pair of symmetric matrices, each of which depends affinely on the decision variables. Although this problem may appear specialized, it is in fact quite general, and includes for example all linear, quadratic, and linear fr ..."
Abstract

Cited by 65 (14 self)
 Add to MetaCart
We consider the problem of minimizing the largest generalized eigenvalue of a pair of symmetric matrices, each of which depends affinely on the decision variables. Although this problem may appear specialized, it is in fact quite general, and includes for example all linear, quadratic, and linear fractional programs. Many problems arising in control theory can be cast in this form. The problem is nondifferentiable but quasiconvex, so methods such as Kelley's cuttingplane algorithm or the ellipsoid algorithm of Shor, Nemirovksy, and Yudin are guaranteed to minimize it. In this paper we describe relevant background material and a simple interior point method that solves such problems more efficiently. The algorithm is a variation on Huard's method of centers, using a selfconcordant barrier for matrix inequalities developed by Nesterov and Nemirovsky. (Nesterov and Nemirovsky have also extended their potential reduction methods to handle the same problem [NN91b].) Since the problem is quasiconvex but not convex, devising a nonheuristic stopping criterion (i.e., one that guarantees a given accuracy) is more difficult than in the convex case. We describe several nonheuristic stopping criteria that are based on the dual of a related convex problem and a new ellipsoidal approximation that is slightly sharper, in some cases, than a more general result due to Nesterov and Nemirovsky. The algorithm is demonstrated on an example: determining the quadratic Lyapunov function that optimizes a decay rate estimate for a differential inclusion.
Structured and Simultaneous Lyapunov Functions for System Stability Problems
, 2001
"... It is shown that many system stability and robustness problems can be reduced to the question of when there is a quadratic Lyapunov function of a certain structure which establishes stability of x = Ax for some appropriate A. The existence of such a Lyapunov function can be determined by solving a c ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
It is shown that many system stability and robustness problems can be reduced to the question of when there is a quadratic Lyapunov function of a certain structure which establishes stability of x = Ax for some appropriate A. The existence of such a Lyapunov function can be determined by solving a convex program. We present several numerical methods for these optimization problems. A simple numerical example is given.
Control System Analysis And Synthesis Via Linear Matrix Inequalities
, 1993
"... A wide variety of problems in systems and control theory can be cast or recast as convex problems that involve linear matrix inequalities (LMIs). For a few very special cases there are "analytical solutions" to these problems, but in general they can be solved numerically very efficiently. In many c ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
A wide variety of problems in systems and control theory can be cast or recast as convex problems that involve linear matrix inequalities (LMIs). For a few very special cases there are "analytical solutions" to these problems, but in general they can be solved numerically very efficiently. In many cases the inequalities have the form of simultaneous Lyapunov or algebraic Riccati inequalities; such problems can be solved in a time that is comparable to the time required to solve the same number of Lyapunov or Algebraic Riccati equations. Therefore the computational cost of extending current control theory that is based on the solution of algebraic Riccati equations to a theory based on the solution of (multiple, simultaneous) Lyapunov or Riccati inequalities is modest. Examples include: multicriterion LQG, synthesis of linear state feedback for multiple or nonlinear plants ("multimodel control"), optimal transfer matrix realization, norm scaling, synthesis of multipliers for Popovlike...
Computation of Lyapunov Functions for Smooth Nonlinear Systems using Convex Optimization
 AUTOMATICA
, 1999
"... It is shown that for smooth nonlinear systems conditions for the existence of a Lyapunov function that guarantees uniform exponential stability can be formulated as linear inequalities defined pointwise in the statespace when assuming a general linearly parameterized class of smooth nonquadratic L ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
It is shown that for smooth nonlinear systems conditions for the existence of a Lyapunov function that guarantees uniform exponential stability can be formulated as linear inequalities defined pointwise in the statespace when assuming a general linearly parameterized class of smooth nonquadratic Lyapunovfunction candidates. Hence, computation of the Lyapunov function involves the solution of a convex largescale optimization problem using linear or quadratic programming. The optimization criterion can for example be selected to find a Lyapunov function which predicts fast decay rate or large region of attraction. Analysis of the tradeoff between accuracy and computational complexity as well as possible conservativeness of the procedure is given particular attention. The procedure is illustrated using numerical examples.
Piecewise Lyapunov functions for robust stability of linear timevarying systems
 Systems & Control Letters
, 1997
"... In this paper, we investigate the use of twoterm piecewise quadratic Lyapunov functions for robust stability of linear timevarying systems. By using the socalled Sprocedure and a special variable reduction method, we provide numerically efficient conditions for the robust asymptotic stability of ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper, we investigate the use of twoterm piecewise quadratic Lyapunov functions for robust stability of linear timevarying systems. By using the socalled Sprocedure and a special variable reduction method, we provide numerically efficient conditions for the robust asymptotic stability of the linear timevarying systems involving the convex combinations of two matrices. An example is included to demonstrate the usefulness of our results. Key words: Robust stability, Piecewise Lyapunov function, Sprocedure, Linear matrix inequality. 1 Introduction The quadratic stability approach is popularly used for robust stability analysis of timevarying uncertain systems. This approach, however, may lead to very conservative results. Alternatively, nonquadratic Lyapunov functions have been used to improve the estimate of robust stability (see [1, 2, 6, 7, 9, 10]). The difficulty with nonquadratic Lyapunov functions is that the resulting optimization problem is typically nonconvex. I...