Details
| Original language | English |
|---|---|
| Title of host publication | Decision Making Under Uncertainty and Constraints |
| Publisher | Springer Verlag |
| Pages | 251-256 |
| Number of pages | 6 |
| ISBN (electronic) | 9783031164156 |
| ISBN (print) | 9783031164149 |
| Publication status | Published - 4 Jan 2023 |
Publication series
| Name | Studies in Systems, Decision and Control |
|---|---|
| Volume | 217 |
| ISSN (Print) | 2198-4182 |
| ISSN (electronic) | 2198-4190 |
Abstract
In general, computing the range of a quadratic function on given intervals is NP-hard. Recently, a feasible algorithm was proposed for computing the range of a specific quadratic function—square of the modulus of a Fourier coefficient. For this function, the rank of the quadratic form—i.e., the number of nonzero eigenvalues—is 2. In this paper, we show that this algorithm can be extended to all the cases when the rank of the quadratic form is bounded by a constant.
ASJC Scopus subject areas
- Computer Science(all)
- Computer Science (miscellaneous)
- Mathematics(all)
- Control and Optimization
- Decision Sciences(all)
- Decision Sciences (miscellaneous)
- Economics, Econometrics and Finance(all)
- Economics, Econometrics and Finance (miscellaneous)
- Engineering(all)
- Control and Systems Engineering
- Engineering(all)
- Automotive Engineering
- Social Sciences(all)
- Social Sciences (miscellaneous)
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Decision Making Under Uncertainty and Constraints. Springer Verlag, 2023. p. 251-256 (Studies in Systems, Decision and Control; Vol. 217).
Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review
}
TY - CHAP
T1 - Fourier Transform and Other Quadratic Problems Under Interval Uncertainty
AU - Galindo, Oscar
AU - Ibarra, Christopher
AU - Kreinovich, Vladik
AU - Beer, Michael
N1 - Funding Information: This work was supported in part by the National Science Foundation grants: • 1623190 (A Model of Change for Preparing a New Generation for Professional Practice in Computer Science), and • HRD-1834620 and HRD-2034030 (CAHSI Includes). It was also supported: • by the AT&T Fellowship in Information Technology, and • by the program of the development of the Scientific-Educational Mathematical Center of Volga Federal District No. 075-02-2020-1478. The authors are thankful to all the participants of the 26th Annual UTEP/NMSU Workshop on Mathematics, Computer Science, and Computational Science (El Paso, Texas, November 5, 2021) for valuable discussions.
PY - 2023/1/4
Y1 - 2023/1/4
N2 - In general, computing the range of a quadratic function on given intervals is NP-hard. Recently, a feasible algorithm was proposed for computing the range of a specific quadratic function—square of the modulus of a Fourier coefficient. For this function, the rank of the quadratic form—i.e., the number of nonzero eigenvalues—is 2. In this paper, we show that this algorithm can be extended to all the cases when the rank of the quadratic form is bounded by a constant.
AB - In general, computing the range of a quadratic function on given intervals is NP-hard. Recently, a feasible algorithm was proposed for computing the range of a specific quadratic function—square of the modulus of a Fourier coefficient. For this function, the rank of the quadratic form—i.e., the number of nonzero eigenvalues—is 2. In this paper, we show that this algorithm can be extended to all the cases when the rank of the quadratic form is bounded by a constant.
UR - http://www.scopus.com/inward/record.url?scp=85146249407&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-16415-6_37
DO - 10.1007/978-3-031-16415-6_37
M3 - Contribution to book/anthology
SN - 9783031164149
T3 - Studies in Systems, Decision and Control
SP - 251
EP - 256
BT - Decision Making Under Uncertainty and Constraints
PB - Springer Verlag
ER -