New bounds for nonconvex quadratically constrained quadratic programming

Moslem Zamani ()
Additional contact information
Moslem Zamani: Tilburg University

Journal of Global Optimization, 2023, vol. 85, issue 3, No 3, 595-613

Abstract: Abstract In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs (QCQPs). We propose two types of bounds for QCQPs, quadratic and cubic bounds. We use affine functions as Lagrange multipliers for quadratic bounds. We demonstrate that most semidefinite relaxations can be obtained as the dual of a quadratic bound. In addition, we study bounds obtained by changing the ground set. For cubic bounds, in addition to affine multipliers we employ quadratic functions. We provide a comparison between the proposed cubic bound and typical bounds for standard quadratic programs. Moreover, we report comparison results of some quadratic and cubic bounds.

Keywords: Quadratically constrained quadratic programming; Semidefinite relaxation; Reformulation-linearization technique (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-022-01224-1 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:jglopt:v:85:y:2023:i:3:d:10.1007_s10898-022-01224-1

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-022-01224-1

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().