Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization

DOI10.1007/S10898-023-01283-YarXiv2101.06219OpenAlexW4382310451MaRDI QIDQ6166103FDOQ6166103

Authors: Markus Gabl 

Publication date: 2 August 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Abstract: In an effort to develop an alternative approach to traditional sparse reformulations, we will provide a new type of convex reformulation of a large class of stochastic quadratically constrained quadratic optimization problems that is similar to Burer's reformulation, but lifts the variables into a comparatively lower dimensional space. The reformulation rests on a generalization of the set-completely positive matrix cone. This cone can then be approximated via inner and outer approximations in order to obtain upper and lower bounds, which potentially close the optimality gap, and hence can give a certificate of exactness for these sparse reformulations outside of traditional, known sufficient conditions. Finally, we provide some numerical experiments, where we asses the quality of the inner and outer approximations, thereby showing that the approximations may indeed close the optimality gap in interesting cases.

Full work available at URL: https://arxiv.org/abs/2101.06219

zbMATH Keywords

matrix completionquadratic optimizationconic optimizationcopositive optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Stochastic programming (90C15)

Cites Work

• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• The completely positive and doubly nonnegative completion problems
• Title not available (Why is that?)
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Copositive Programming
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization
• Two-stage stochastic standard quadratic optimization
• On reduced semidefinite programs for second order moment bounds with applications
• Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
• A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
• Exploiting partial correlations in distributionally robust optimization
• Least Squares Estimation Based SDP Cuts for SOCP Relaxation of AC OPF

Cited In (1)

• Further development in convex conic reformulation of geometric nonconvex conic optimization problems

This page was built for publication: Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166103)