Exactness criteria for SDP-relaxations of quadratic extremum problems
type: Item
instance of: scholarly article
title: Exactness criteria for SDP-relaxations of quadratic extremum problems
zbMATH Open document ID: 1355.90060
author: O. A. Berezovskyi
published in: Cybernetics and Systems Analysis
publication date: 2017-02-07T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6681572
zbMATH Keywords: quadratic extremum problem
zbMATH Keywords: SDP-relaxation
zbMATH Keywords: dual bound
zbMATH Keywords: Lagrangian function
zbMATH Keywords: exact relaxation
MaRDI profile type: Publication
full work available at URL: s10559-016-9893-3
OpenAlex ID: W2554521521
cites work: Q4324980
cites work: Semidefinite Programming
cites work: Q4517108
cites work: Global optimization with polynomials and the problem of moments
cites work: Q5292090
cites work: Q4323601
cites work: Nondifferentiable optimization and polynomial problems
cites work: An approach to determining Shor's dual quadratic estimates
cites work: On Lagrangian relaxation of quadratic matrix constraints
cites work: On the accuracy of dual bounds for quadratic extremum problems
cites work: Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain
DOI: 10.1007/S10559-016-9893-3
Recommended article: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Recommended article: The geometry of SDP-exactness in quadratic optimization
Recommended article: Exact SDP relaxations for classes of nonlinear semidefinite programming problems
Recommended article: Exactness conditions for an SDP relaxation of the extended trust region problem
Recommended article: Q3079666
Recommended article: Exact SDP relaxations for quadratic programs with bipartite graph structures
Recommended article: On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Recommended article: SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS
Recommended article: On convex relaxations for quadratically constrained quadratic programming
Recommended article: Convex Relaxations of (0, 1)-Quadratic Programming
description: scientific article; zbMATH DE number 6681572