A Simple Proof of Nehari’s Theorem Based on Duality

IF 7 1区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS

IEEE Transactions on Automatic Control Pub Date : 2026-10-01 Epub Date: 2026-03-07 DOI:10.1109/TAC.2026.3691281

Cristian R. Rojas

引用次数: 0

Abstract

In this technical note, we provide a simple proof of Nehari’s theorem on the optimal approximation by

$\mathcal {H}_\infty$

functions, based on convex duality.

查看原文本刊更多论文

基于对偶的Nehari定理的简单证明

在这个技术笔记中，我们提供了一个简单的Nehari定理关于$\mathcal {H}_\infty$函数的最优逼近的证明，基于凸对偶。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Automatic Control 工程技术-工程：电子与电气

CiteScore

11.30

自引率

5.90%

发文量

824

审稿时长

9 months

期刊介绍： In the IEEE Transactions on Automatic Control, the IEEE Control Systems Society publishes high-quality papers on the theory, design, and applications of control engineering. Two types of contributions are regularly considered: 1) Papers: Presentation of significant research, development, or application of control concepts. 2) Technical Notes and Correspondence: Brief technical notes, comments on published areas or established control topics, corrections to papers and notes published in the Transactions. In addition, special papers (tutorials, surveys, and perspectives on the theory and applications of control systems topics) are solicited.