Discrete minimax approximation with application to filter design
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24220%2F03%3A00000117" target="_blank" >RIV/46747885:24220/03:00000117 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Discrete minimax approximation with application to filter design
Original language description
Minimax approximation is a very difficult problem, which cannot be solved by using standard optimization methods. In this paper, the sequential quadratic programming method and the proximal bundle method is presented and some numerical results are given.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of SIMONA 2003 workshop
ISBN
80-7083-774-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
65-70
Publisher name
Technická univerzita Liberec
Place of publication
Liberec
Event location
Liberec, Česká republika
Event date
Sep 1, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—