Conditions for a minimax optimum

This paper derives and discusses necessary conditions for an optimum in nonlinear minimax approximation problems. A straightforward geometrical interpretation is presented. The results may be used to test for convergence in computer-aided network optimization, in tests for optimality in the Chebyshe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuit theory Jg. 18; H. 4; S. 476 - 479
1. Verfasser: Bandler, J.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.01.1971
Schlagworte:
Algorithm design and analysis
Approximation algorithms
Chebyshev approximation
Computer networks
Convergence
Design optimization
Minimax techniques
Network synthesis
Optimization methods
Testing
ISSN:0018-9324
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper derives and discusses necessary conditions for an optimum in nonlinear minimax approximation problems. A straightforward geometrical interpretation is presented. The results may be used to test for convergence in computer-aided network optimization, in tests for optimality in the Chebyshev sense of any given design, and to gain insight which may be helpful in developing minimax approximation algorithms.
AbstractList This paper derives and discusses necessary conditions for an optimum in nonlinear minimax approximation problems. A straightforward geometrical interpretation is presented. The results may be used to test for convergence in computer-aided network optimization, in tests for optimality in the Chebyshev sense of any given design, and to gain insight which may be helpful in developing minimax approximation algorithms.
Author Bandler, J.
Author_xml – sequence: 1
  givenname: J.
  surname: Bandler
  fullname: Bandler, J.
BookMark eNpNj81qwzAQhHVIoUmae6EXv4DdXUuupGMx_QkEenHOQopWoFJbwXKhffs6OIeeFmZnhvk2bDWkgRi7R6gQQT92bVehllghKM4BV2wNgKrUvBa3bJPzJwCHRus1K9o0-DjFNOQipLGwRR-H2NufIp2n2H_3d-wm2K9Mu-vdsuPrS9e-l4ePt337fChPNYqpbKQTMjjnPUeymiSS0Fw3IByKIIA35LkVylETlH1yqkY_65ILL9Ws8i2Dpfc0ppxHCuY8zjvGX4NgLlRmpjIXKnOlmiMPSyQS0T_78v0DRhFLag
CODEN ICSYBT
Cites_doi 10.1109/TCT.1968.1082855
10.1093/comjnl/12.1.63
10.1093/comjnl/8.4.358
10.1109/TCT.1969.1082982
10.1109/PROC.1967.6018
10.1109/TCT.1969.1082917
10.1109/ICC.2005.1494970
10.1109/TMTT.1969.1127006
10.1109/TMTT.1969.1127005
10.1109/TMTT.1969.1127007
10.1109/TCT.1969.1082965
10.1109/TMTT.1970.1127425
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1109/TCT.1971.1083301
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 479
ExternalDocumentID 10_1109_TCT_1971_1083301
1083301
GroupedDBID -~X
0R~
29I
5GY
6IK
85S
AAJGR
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
ACNCT
AGQYO
AHBIQ
AI.
ALLEH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
HZ~
H~9
IAAWW
IDIHD
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
RIE
RNS
TN5
VH1
AAYXX
CITATION
ID FETCH-LOGICAL-c214t-57b47fbbdd31ea9e71e4939504b14f4035ed3a48be5f8a6b821d4f4734d788be3
IEDL.DBID RIE
ISICitedReferencesCount 15
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=1083301&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9324
IngestDate Sat Nov 29 02:07:46 EST 2025
Wed Aug 27 02:53:35 EDT 2025
IsPeerReviewed false
IsScholarly false
Issue 4
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c214t-57b47fbbdd31ea9e71e4939504b14f4035ed3a48be5f8a6b821d4f4734d788be3
PageCount 4
ParticipantIDs crossref_primary_10_1109_TCT_1971_1083301
ieee_primary_1083301
PublicationCentury 1900
PublicationDate 1971-01-01
PublicationDateYYYYMMDD 1971-01-01
PublicationDate_xml – month: 01
  year: 1971
  text: 1971-01-01
  day: 01
PublicationDecade 1970
PublicationTitle IEEE transactions on circuit theory
PublicationTitleAbbrev T-CAS
PublicationYear 1971
Publisher IEEE
Publisher_xml – name: IEEE
References ref12
temes (ref2) 1969
ref14
ref11
ref10
bandler (ref13) 1970
ref1
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – year: 1969
  ident: ref2
  publication-title: Computer Oriented Circuit Design
– ident: ref5
  doi: 10.1109/TCT.1968.1082855
– start-page: 379
  year: 1970
  ident: ref13
  article-title: Sensitivities in terms of wave variables
  publication-title: Proc 8th Annu Allerton Conf Circuit and System Theory
– ident: ref6
  doi: 10.1093/comjnl/12.1.63
– ident: ref12
  doi: 10.1093/comjnl/8.4.358
– ident: ref7
  doi: 10.1109/TCT.1969.1082982
– ident: ref4
  doi: 10.1109/PROC.1967.6018
– ident: ref1
  doi: 10.1109/TCT.1969.1082917
– ident: ref11
  doi: 10.1109/ICC.2005.1494970
– ident: ref9
  doi: 10.1109/TMTT.1969.1127006
– ident: ref8
  doi: 10.1109/TMTT.1969.1127005
– ident: ref10
  doi: 10.1109/TMTT.1969.1127007
– ident: ref14
  doi: 10.1109/TCT.1969.1082965
– ident: ref3
  doi: 10.1109/TMTT.1970.1127425
SSID ssj0030599
Score 1.168018
Snippet This paper derives and discusses necessary conditions for an optimum in nonlinear minimax approximation problems. A straightforward geometrical interpretation...
SourceID crossref
ieee
SourceType Index Database
Publisher
StartPage 476
SubjectTerms Algorithm design and analysis
Approximation algorithms
Chebyshev approximation
Computer networks
Convergence
Design optimization
Minimax techniques
Network synthesis
Optimization methods
Testing
Title Conditions for a minimax optimum
URI https://ieeexplore.ieee.org/document/1083301
Volume 18
WOSCitedRecordID wos1083301&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  issn: 0018-9324
  databaseCode: RIE
  dateStart: 19630101
  customDbUrl:
  isFulltext: true
  dateEnd: 19731231
  titleUrlDefault: https://ieeexplore.ieee.org/
  omitProxy: false
  ssIdentifier: ssj0030599
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLbGxAEOvAZivNQDFyQ6miZtkiOamDhNHIa0W5WHK3HYisaK-Pk4bYeGxIVbZCVSYie2vzixAW4lV0jAQ8epVTwWOTex8tLHjjNfpmST8tI3xSbkdKrmc_3Sg_ufvzCI2Dw-w1FoNrF8X7k6XJXRCVcEvwnr7EiZt3-1NlqXhzwjrdalA0xewiYkmeiH2Xg2YlqyUTf-lwnaqqnSmJTJ4f8mcwQHnesYPbayPoYeLk9gfyuh4ACicRVC0GErReSNRiYKqUMW5iuqSDUs6sUpvE6eZuPnuKuBELuUiXWcSStkaa33nKHRKBkKzXWWCMtEKRKeoedGKItZqUxuVco80SUXnsCtRX4G_WW1xHOIrNMlGXMnkboYb6wTKrfksmGaobNyCHcbthTvbaqLooEIiS6IhUVgYdGtegiDwJGtfg354m_yJeyFwe3NxRX016sar2HXfa7fPlY3jRy_AVc4mkg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lCurBVxXrcw9eBLduNtlNcpRiqViLhxV6W_KYBQ_tSm3Fn-9kdysVvHgLQwjJTDIzXyaZIeRaMAkIPFQYG8lCnjIdSidcaBl1RYw2KS1cVWxCjMdyMlEvLXL78xcGAKrHZ9DzzSqW70q79FdleMIlwm_EOhsJR9xT_9Za6V3mM43UehePMPoJq6BkpO6yftajStBeM8IvI7RWVaUyKoO9_01nn-w2zmNwX0v7gLRgdkh21lIKdkjQL30Q2m-mAP3RQAc-echUfwUlKofpcnpEXgcPWX8YNlUQQhtTvggTYbgojHGOUdAKBAWumEoibigveMQScExzaSAppE6NjKlDumDcIbw1wI5Je1bO4IQExqoCzbkVgF2008ZymRp02iBOwBrRJTcrtuTvdbKLvAIJkcqRhblnYd6suks6niNr_Sry6d_kK7I1zJ5H-ehx_HRGtv1A9T3GOWkv5ku4IJv2c_H2Mb-sZPoNkeqdjw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Conditions+for+a+minimax+optimum&rft.jtitle=IEEE+transactions+on+circuit+theory&rft.au=Bandler%2C+J.&rft.date=1971-01-01&rft.issn=0018-9324&rft.volume=18&rft.issue=4&rft.spage=476&rft.epage=479&rft_id=info:doi/10.1109%2FTCT.1971.1083301&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCT_1971_1083301
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9324&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9324&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9324&client=summon