Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2021
Data sources: zbMATH Open
INFORMS Journal on Computing
Article . 2021 . Peer-reviewed
Data sources: Crossref
DBLP
Article . 2021
Data sources: DBLP
versions View all 3 versions
addClaim

Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs

Perspective reformulations of semicontinuous quadratically constrained quadratic programs
Authors: Xiaojin Zheng; Yutong Pan; Zhaolin Hu;

Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs

Abstract

We study perspective reformulations (PRs) of semicontinuous quadratically constrained quadratic programs (SQCQPs) in this paper. Based on perspective functions, we first propose a class of PRs for SQCQPs and discuss how to find the best PR in this class via strong duality and lifting techniques. We then study the properties of the PR class and relate them to alternative formulations that are used to derive lower bounds for SQCQPs. Finally, we embed the PR bounds in branch-and-bound algorithms and conduct computational experiments to illustrate the effectiveness of the proposed approach.

Related Organizations
Keywords

semicontinuous variable, quadratically constrained quadratic program, Mixed integer programming, Semidefinite programming, Quadratic programming, perspective reformulation, semidefinite programming

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!