Faster, but weaker, relaxations for quadratically constrained quadratic programs

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Computational optimization and applications

• Publication date

  2014-10-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10589-013-9618-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

  2011cited by this paper
• Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations

  2011cited by this paper
• Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

  2010cited by this paper
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

  2010cited by this paper
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem

  2009cited by this paper
• Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

  2009cited by this paper
• Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results

  2003cited by this paper
• First- and second-order methods for semidefinite programming

  2003cited by this paper
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

  2003cited by this paper
• Semidefinite programming and integer programming

  2002cited by this paper
• Second order cone programming relaxation of nonconvex quadratic optimization problems

  2001cited by this paper
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

  2000cited by this paper
• Global Optimization with Polynomials and the Problem of Moments

  2000cited by this paper
• Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

  1999cited by this paper
• A Spectral Bundle Method for Semidefinite Programming

  1999cited by this paper
• A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

  1998cited by this paper
• Semidefinite Programming Relaxation for Nonconvex Quadratic Programs

  1997cited by this paper
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

  1995cited by this paper
• Cones of Matrices and Set-Functions and 0-1 Optimization

  1991cited by this paper
• Positive definite completions of partial Hermitian matrices

  1984cited by this paper

• Non-convex optimization problems with linear KKT subsystem

  2025cites this paper
• A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint

  2023cites this paper
• An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP

  2022cites this paper
• Sustainable two stage supply chain management: A quadratic optimization approach with a quadratic constraint

  2022cites this paper
• (Global) Optimization: Historical notes and recent developments

  2021cites this paper
• A New Spatial Branch and Bound Algorithm for Quadratic Program with One Quadratic Constraint and Linear Constraints

  2020cites this paper
• A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs

  2020influential citation
• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints

  2018cites this paper
• New SOCP relaxation and branching rule for bipartite bilinear programs

  2018cites this paper
• The Convex Hull of a Quadratic Constraint over a Polytope

  2018cites this paper
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization

  2018influential citation
• Quadratic programming over ellipsoids with applications to constrained linear regression and tensor decomposition

  2017cites this paper
• Completely positive reformulations for polynomial optimization

  2015cites this paper
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems

  2015cites this paper
• Completely positive reformulations for polynomial optimization

  2014cites this paper
• Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained QPs

  2013cites this paper
• Reduced-Complexity Semidefinite Relaxations of Optimal Power Flow Problems

  2013cites this paper