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

DOI10.1007/s10898-023-01283-yarXiv2101.06219OpenAlexW4382310451MaRDI QIDQ6166103

Markus Gabl

Publication date: 2 August 2023

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

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

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

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