Strong solvability of restricted interval systems and its applications in quadratic and geometric programming
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10488661" target="_blank" >RIV/00216208:11320/24:10488661 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=4D7_FtGakZ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=4D7_FtGakZ</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.laa.2022.12.024" target="_blank" >10.1016/j.laa.2022.12.024</a>
Alternative languages
Result language
angličtina
Original language name
Strong solvability of restricted interval systems and its applications in quadratic and geometric programming
Original language description
We consider interval systems of linear equations and inequalities with a restriction to some a priori given set. We focus on a characterization of strong solvability, that is, solvability for each realization of interval values, and we compare this with an existence of a strong solution defined analogously. The motivation comes from the area of interval -valued optimization problems, where strong solvability means guaranteed feasibility of any realization of the problem. Strong solvability with strict inequalities implies the robust Slater condition, which ensures that standard optimality conditions can be used. We apply the issues particularly in two optimization classes, convex quadratic programming with quadratic constraints and posynomial geometric programming. For the former, we also utilize the presented result to improve a characterization of the worst case optimal value. Eventually, we state several open problems that emerged while deriving the results. (c) 2023 Elsevier Inc. All rights reserved.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
50201 - Economic Theory
Result continuities
Project
<a href="/en/project/GA22-11117S" target="_blank" >GA22-11117S: Global sensitivity analysis and stability in optimization problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2024
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
Name of the periodical
Linear Algebra and Its Applications
ISSN
0024-3795
e-ISSN
1873-1856
Volume of the periodical
693
Issue of the periodical within the volume
Neuveden
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
4-21
UT code for WoS article
001239610100001
EID of the result in the Scopus database
2-s2.0-85146466697