Skip Navigation

IMA Journal of Mathematical Control and Information 1998 15(3):285-301; doi:10.1093/imamci/15.3.285
© 1998 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 DRAGAN, V.
Right arrow Articles by STOICA, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An alternative computational solution for optimal two-block Nehari and H{infty} problems

VASILE DRAGAN, ARISTIDE HALANAY and ADRIAN STOICA

Institute of Mathematics of the Romanian Academy P.O. Box 1-764, Ro-70700, Bucharest, Romania E-mail: vdragan{at}imar.or
Faculty of Mathematics, str. Academiei no. 14, 70109, Bucharest, Romania
Department of Aerospace Engineering, Polytechnic University of Bucharest, str. Splaiul Independentei no. 313, 77206, Bucharest, Romania E-mail: astoica{at}aerol.aero.pub.ro

A description is presented of a {gamma} procedure to compute an optimal distance in the two-block Nehari problem. Explicit formulae are given for an optimal solution to the two-block Nehari problem in terms of the optimal distance value. Similar formulae are obtained for a two-block H{infty} approximation problem known as the disturbance-feedforward problem.


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.