Acyclic semidefinite approximations of quadratically constrained quadratic programs

No abstract is available for this paper.

• Publication year

  2015

• Venue

  American Control Conference

• Publication date

  2015-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ACC.2015.7172269
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Semidefinite optimization

  2019cited by this paper
• Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure

  2014influential reference
• Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow

  2014cited by this paper
• A rank minimization algorithm to enhance semidefinite relaxations of Optimal Power Flow

  2013cited by this paper
• Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow

  2012influential reference
• Moment inequalities for sums of random matrices and their applications in optimization

  2011cited by this paper
• Convex Optimization-Based Beamforming

  2010cited by this paper
• Convex Optimization-based Beamforming : From Receive to Transmit and Network Designs

  2010cited by this paper
• Semidefinite Relaxation of Quadratic Optimization Problems

  2010cited by this paper
• Semidefnite Relaxation Bounds for Indefinite Homogeneous

  2007cited by this paper
• Theory of semidefinite programming for Sensor Network Localization

  2005cited by this paper
• Performance analysis of quasi-maximum-likelihood detector based on semi-definite programming

  2005cited by this paper
• Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

  2003cited by this paper
• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems

  2002cited by this paper
• Semidefinite Programming for Combinatorial Optimization

  2000cited by this paper
• Quadratic maximization and semidefinite relaxation

  2000cited by this paper
• Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system

  1999cited by this paper
• Approximating quadratic programming with bound and quadratic constraints

  1999cited by this paper
• On maximization of quadratic form over intersection of ellipsoids with common center

  1999cited by this paper
• Approximating Quadratic Programming With Bound Constraints

  1997cited by this paper
• Quality of semidefinite relaxation for nonconvex quadratic optimization

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

  1995cited by this paper
• Some perturbation theory for linear programming

  1994influential reference

• Solvability Regions of Affinely Parameterized Quadratic Equations

  2017cites this paper
• Construction of power flow feasibility sets

  2015cites this paper
• Concave Quadratic Cuts for Mixed-Integer Quadratic Problems

  2015cites this paper