Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
From MaRDI portal
Publication:5746688
DOI10.1080/10556788.2012.749876zbMath1282.90117OpenAlexW2055523720MaRDI QIDQ5746688
Bin Yu, Jong-Shi Pang, John E. Mitchell
Publication date: 7 February 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.749876
Related Items
A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, On conic QPCCs, conic QCQPs and completely positive programs, A fair division approach to humanitarian logistics inspired by conditional value-at-risk, A technique to derive the analytical form of convex envelopes for some bivariate functions, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes, Convex envelopes of bivariate functions through the solution of KKT systems, Solving linear programs with complementarity constraints using branch-and-cut
Cites Work
- An LPCC approach to nonconvex quadratic programs
- On linear programs with linear complementarity constraints
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- A new reformulation-linearization technique for bilinear programming problems
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A polyhedral branch-and-cut approach to global optimization
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- BARON: A general purpose global optimization software package
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- An overview of bilevel optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Jointly Constrained Biconvex Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel Programming
- Classification model selection via bilevel programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
