Exactness criteria for SDP-relaxations of quadratic extremum problems

DOI10.1007/s10559-016-9893-3zbMath1355.90060OpenAlexW2554521521MaRDI QIDQ508574

O. A. Berezovskyi

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

zbMATH Keywords

Lagrangian functiondual boundquadratic extremum problemexact relaxationSDP-relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items

Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems, Exact dual bounds for some nonconvex minimax quadratic optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the accuracy of dual bounds for quadratic extremum problems
• An approach to determining Shor's dual quadratic estimates
• Nondifferentiable optimization and polynomial problems
• Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain
• On Lagrangian Relaxation of Quadratic Matrix Constraints
• Global Optimization with Polynomials and the Problem of Moments
• Semidefinite Programming