Quadratic programs with hollows
From MaRDI portal
Publication:1659682
DOI10.1007/S10107-017-1157-0zbMATH Open1401.90147OpenAlexW2611911673MaRDI QIDQ1659682FDOQ1659682
Authors: Boshi Yang, Samuel Burer, Kurt M. Anstreicher 
Publication date: 22 August 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1157-0
Recommendations
- The convex hull of a quadratic constraint over a polytope
- On Convex Hulls of Epigraphs of QCQPs
- scientific article; zbMATH DE number 1380758
- On the tightness of SDP relaxations of QCQPs
- Convex hull presentation of A quadratically constrained set and its application in solving quadratic programming problems
Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Semidefinite programming (90C22)
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Title not available (Why is that?)
- Trust Region Methods
- New Results on Quadratic Minimization
- The generalized trust region subproblem
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- On Cones of Nonnegative Quadratic Functions
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- The trust region subproblem with non-intersecting linear constraints
- Title not available (Why is that?)
- Second-order-cone constraints for extended trust-region subproblems
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A gentle, geometric introduction to copositive optimization
- Computable representations for convex hulls of low-dimensional quadratic forms
- On interval-subgradient and no-good cuts
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- On the Slater condition for the SDP relaxations of nonconvex sets
- On the separation of split inequalities for non-convex quadratic integer programming
Cited In (15)
- Semidefinite representable reformulations for two variants of the trust-region subproblem
- Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Exploiting partial correlations in distributionally robust optimization
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Alternative SDP and SOCP approximations for polynomial optimization
- On the tightness of SDP relaxations of QCQPs
- A second-order cone based approach for solving the trust-region subproblem and its variants
- A survey of hidden convex optimization
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- The generalized trust region subproblem: solution complexity and convex hull results
- Optimization under uncertainty and risk: quadratic and copositive approaches
- (Global) optimization: historical notes and recent developments
- Removing redundant quadratic constraints
- Convex hull results on quadratic programs with non-intersecting constraints
This page was built for publication: Quadratic programs with hollows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1659682)
