Global optimization of linear hybrid systems with explicit transitions
The global optimization of hybrid systems described by linear time-varying ordinary differential equations is examined. A method to construct convex relaxations of general, nonlinear Bolza-type objective functions or constraints subject to an embedded hybrid system with explicit transitions is prese...
        Saved in:
      
    
          | Published in | Systems & control letters Vol. 51; no. 5; pp. 363 - 375 | 
|---|---|
| Main Authors | , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        Amsterdam
          Elsevier B.V
    
        01.04.2004
     Elsevier  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0167-6911 1872-7956  | 
| DOI | 10.1016/j.sysconle.2003.09.005 | 
Cover
| Summary: | The global optimization of hybrid systems described by linear time-varying ordinary differential equations is examined. A method to construct convex relaxations of general, nonlinear Bolza-type objective functions or constraints subject to an embedded hybrid system with explicit transitions is presented. The optimization problem can be solved using gradient-based algorithms in a branch and bound framework that is shown to be infinitely convergent when the implied state bounds are employed. | 
|---|---|
| ISSN: | 0167-6911 1872-7956  | 
| DOI: | 10.1016/j.sysconle.2003.09.005 |