Interplay of non-convex quadratically constrained problems with adjustable robust optimization

Immanuel Bomze () and Markus Gabl ()
Additional contact information
Immanuel Bomze: University of Vienna
Markus Gabl: University of Vienna

Mathematical Methods of Operations Research, 2021, vol. 93, issue 1, No 4, 115-151

Abstract: Abstract In this paper we explore convex reformulation strategies for non-convex quadratically constrained optimization problems (QCQPs). First we investigate such reformulations using Pataki’s rank theorem iteratively. We show that the result can be used in conjunction with conic optimization duality in order to obtain a geometric condition for the S-procedure to be exact. Based upon known results on the S-procedure, this approach allows for some insight into the geometry of the joint numerical range of the quadratic forms. Then we investigate a reformulation strategy introduced in recent literature for bilinear optimization problems which is based on adjustable robust optimization theory. We show that, via a similar strategy, one can leverage exact reformulation results of QCQPs in order to derive lower bounds for more complicated quadratic optimization problems. Finally, we investigate the use of reformulation strategies in order to derive characterizations of set-copositive matrix cones. Empirical evidence based upon first numerical experiments shows encouraging results.

Keywords: Robust optimization; Quadratic optimization; Conic optimization; S-Lemma; Copositivity (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s00186-020-00726-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:93:y:2021:i:1:d:10.1007_s00186-020-00726-6

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-020-00726-6

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().