Convex hull results on quadratic programs with non-intersecting constraints

DOI10.1007/s10107-023-01985-xOpenAlexW4379653177MaRDI QIDQ6126659

Publication date: 9 April 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-023-01985-x

zbMATH Keywords

quadratically constrained quadratic programming semidefinite programming convex hull asymptotic cone non-intersecting

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
S-lemma with equality and its applications
On conic QPCCs, conic QCQPs and completely positive programs
On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Representing quadratically constrained quadratic programs as generalized copositive programs
The generalized trust region subproblem
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Strong duality for generalized trust region subproblem: S-lemma with interval bounds
How to convexify the intersection of a second order cone and a nonconvex quadratic
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
Quadratic programming with one negative eigenvalue is NP-hard
Semidefinite programming relaxation for nonconvex quadratic programs
A semidefinite framework for trust region subproblems with applications to large scale minimization
Approximation algorithms for quadratic programming
Quadratic programs with hollows
The generalized trust region subproblem: solution complexity and convex hull results
On the tightness of SDP relaxations of QCQPs
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
A gentle, geometric introduction to copositive optimization
Convex hull of two quadratic or a conic quadratic and a quadratic inequality
Unbounded convex sets for non-convex mixed-integer quadratic programming
The trust region subproblem with non-intersecting linear constraints
Computable representations for convex hulls of low-dimensional quadratic forms
KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
New Results on Quadratic Minimization
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
The Convex Hull of a Quadratic Constraint over a Polytope
Second-Order-Cone Constraints for Extended Trust-Region Subproblems
On Cones of Nonnegative Quadratic Functions
Spectrahedral cones generated by rank \(1\) matrices

This page was built for publication: Convex hull results on quadratic programs with non-intersecting constraints