Pages that link to "Item:Q1925792"
From MaRDI portal
The following pages link to On convex relaxations for quadratically constrained quadratic programming (Q1925792):
Displaying 16 items.
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- (Q5208413) (← links)
- An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs (Q5244155) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming (Q5408222) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices (Q5964239) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations (Q6665387) (← links)
