Please use this identifier to cite or link to this item:
http://repositorio.unicamp.br/jspui/handle/REPOSIP/346132
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.CRUESP | UNIVERSIDADE ESTADUAL DE CAMPINAS | pt_BR |
dc.contributor.authorunicamp | Geromel, José Cláudio | - |
dc.contributor.authorunicamp | Deaecto, Grace Silva | - |
dc.type | Artigo | pt_BR |
dc.title | Generalized Kleinman-Newton method | pt_BR |
dc.contributor.author | Geromel, JC | - |
dc.contributor.author | Deaecto, GS | - |
dc.subject | Métodos numéricos | pt_BR |
dc.subject | Controle ótimo | pt_BR |
dc.subject.otherlanguage | Numerical methods | pt_BR |
dc.subject.otherlanguage | Optimal control | pt_BR |
dc.description.abstract | This paper addresses the general problem of optimal linear control design subject to convex gain constraints. Classical approaches based exclusively on Riccati equations or linear matrix inequalities are unable to treat problems that incorporate feedback gain constraints, for instance, the reduced-order (including static) output feedback control design. In this paper, these two approaches are put together to obtain a genuine generalization of the celebrated Kleinman-Newton method. The convergence to a local minimum is monotone. We believe that other control design problems can be also considered by the adoption of the same ideas and algebraic manipulations. Several examples borrowed from the literature are solved for illustration and comparison | pt_BR |
dc.relation.ispartof | Optimal control applications and methods | pt_BR |
dc.relation.ispartofabbreviation | Optim. control appl. methods | pt_BR |
dc.publisher.city | Oxford | pt_BR |
dc.publisher.country | Reino Unido | pt_BR |
dc.publisher | John Wiley & Sons | pt_BR |
dc.date.issued | 2018 | - |
dc.date.monthofcirculation | Mar./Apr. | pt_BR |
dc.language.iso | eng | pt_BR |
dc.description.volume | 39 | pt_BR |
dc.description.issuenumber | 2 | pt_BR |
dc.description.issuespecial | Global and robust optimization of dynamic systems | pt_BR |
dc.description.firstpage | 1130 | pt_BR |
dc.description.lastpage | 1140 | pt_BR |
dc.rights | Fechado | pt_BR |
dc.source | WOS | pt_BR |
dc.identifier.issn | 0143-2087 | pt_BR |
dc.identifier.eissn | 1099-1514 | pt_BR |
dc.identifier.doi | 10.1002/oca.2400 | pt_BR |
dc.identifier.url | https://onlinelibrary.wiley.com/doi/full/10.1002/oca.2400 | pt_BR |
dc.description.sponsorship | CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQ | pt_BR |
dc.description.sponsordocumentnumber | 443166/2014-5; 306911/2015-9; 303887/2014-1 | pt_BR |
dc.date.available | 2020-07-27T13:02:56Z | - |
dc.date.accessioned | 2020-07-27T13:02:56Z | - |
dc.description.provenance | Submitted by Mariana Aparecida Azevedo (mary1@unicamp.br) on 2020-07-27T13:02:56Z No. of bitstreams: 0. Added 1 bitstream(s) on 2021-01-08T19:02:32Z : No. of bitstreams: 1 000427136800044.pdf: 725796 bytes, checksum: f82ae863146cf7e1e94dee7028b107af (MD5) | en |
dc.description.provenance | Made available in DSpace on 2020-07-27T13:02:56Z (GMT). No. of bitstreams: 0 Previous issue date: 2018 | en |
dc.identifier.uri | http://repositorio.unicamp.br/jspui/handle/REPOSIP/346132 | - |
dc.contributor.department | Departamento de Engenharia de Computação e Automação Industrial | pt_BR |
dc.contributor.department | Departamento de Mecânica Computacional | pt_BR |
dc.contributor.unidade | Faculdade de Engenharia Elétrica e de Computação | pt_BR |
dc.contributor.unidade | Faculdade de Engenharia Mecânica | pt_BR |
dc.subject.keyword | Linear matrix inequality | pt_BR |
dc.identifier.source | 000427136800044 | pt_BR |
dc.creator.orcid | 0000-0002-4961-3428 | pt_BR |
dc.creator.orcid | 0000-0001-8937-7258 | pt_BR |
dc.type.form | Artigo de pesquisa | pt_BR |
Appears in Collections: | FEEC - Artigos e Outros Documentos FEM - Artigos e Outros Documentos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
000427136800044.pdf | 708.79 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.