(Enter summary)
Abstract: This paper de-
scribes an algorithm that either finds a quadratic Lyapunov function or terminates with
a proof that no quadratic Lyapunov function exists. The algorithm is an interior-point
method based on the theory developed by Nesterov and Nemirovsky [2] (Update)
Similar documents based on text: More All
0.5: Computation of Piecewise Quadratic Lyapunov Functions for.. - Johansson, Rantzer (1998)
(Correct)
0.5: Method of Centers for Minimizing Generalized Eigenvalues - Boyd, Ghaoui (1993)
(Correct)
0.4: ANALYSIS OF PIECEWISE LINEAR SYSTEMS VIA CONVEX.. - Department Of Automatic
(Correct)
BibTeX entry: (Update)
L. VANDENBERGHE and S. BOYD. A polynomial-time algorithm for determining quadratic Lyapunov functions for nonlinear systems. In Eur. Conf. Circuit Th. and Design, pages 1065--1068, 1993. http://citeseer.ist.psu.edu/vandenberghe93polynomialtime.html More
@article{ vandenberghe93polynomialtime,
author = "L. Vandenberghe and S. Boyd",
title = "A polynomial--time algorithm for determining quadratic {Lyapunov} functions for nonlinear systems",
journal = "Proceedings of the European Conference on Circuit Theory and Design",
pages = "1065--1068",
year = "1993",
url = "citeseer.ist.psu.edu/vandenberghe93polynomialtime.html" }
Citations (may not include all citations):
448
A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984
104
LSQR: An algorithm for sparse linear equations and sparse li.. (context) - Paige, Saunders - 1982
90
Primal-dual potential reduction method for problems involvin..
- Vandenberghe, Boyd - 1993
17
Structured and simultaneous Lyapunov functions for system st..
- Boyd, Yang - 1989
1
nomial methods in convex programming: Theor (context) - Nesterov, Nemirovsky et al. - 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC