Exactness criteria for SDP-relaxations of quadratic extremum problems
From MaRDI portal
Publication:508574
DOI10.1007/S10559-016-9893-3zbMATH Open1355.90060OpenAlexW2554521521MaRDI QIDQ508574FDOQ508574
Publication date: 7 February 2017
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-016-9893-3
Recommendations
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- The geometry of SDP-exactness in quadratic optimization
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Exactness conditions for an SDP relaxation of the extended trust region problem
- SDP relaxation of homogeneous quadratic optimization: approximation bounds and applications
- Exact SDP relaxations for quadratic programs with bipartite graph structures
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- SDP relaxations for quadratic optimization problems derived from polynomial optimization problems
- On convex relaxations for quadratically constrained quadratic programming
- Convex Relaxations of (0, 1)-Quadratic Programming
Cites Work
- Title not available (Why is that?)
- Semidefinite Programming
- Global optimization with polynomials and the problem of moments
- Nondifferentiable optimization and polynomial problems
- Semidefinite programming and integer programming
- On the accuracy of dual bounds for quadratic extremum problems
- An approach to determining Shor's dual quadratic estimates
- On Lagrangian relaxation of quadratic matrix constraints
- Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- KKT-based primal-dual exactness conditions for the Shor relaxation
- Exact SDP relaxations for quadratic programs with bipartite graph structures
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
This page was built for publication: Exactness criteria for SDP-relaxations of quadratic extremum problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508574)
