Skip Navigation

IMA Journal of Mathematical Control and Information 1996 13(2):173-194; doi:10.1093/imamci/13.2.173
© 1996 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by IONESCU, V.
Right arrow Articles by OARA, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The four-block Nehari problem: a generalized Popov-Yakubovich-type approach

VLAD IONESCU and CHRISTIAN OARA

Faculty of Automatic Control and Computers, University Politehnica Bucharest 3 Emile Zola, 71272, Bucharest, Romania
Faculty of Automatic Control and Computers, University Politehnica Bucharest 34 Austrului, 73115, Bucharest, Romania

Using the so-called ‘signature condition’—an argument based on a generalized Popov-Yakubovich theory—combined with simple algebraic manipulations performed on appropriate Popov triplets, a characterization of the class of all suboptimal solutions to the four-block Nehari problem is easily derived. In order to underline the advantages of the proposed theory, several representative connections with the well-known embedding technique are also emphasized.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.