Exact dual bounds for some nonconvex minimax quadratic optimization problems
type: Item
instance of: scholarly article
title: Exact dual bounds for some nonconvex minimax quadratic optimization problems
zbMATH Open document ID: 1472.90152
published in: Cybernetics and Systems Analysis
publication date: 2021-08-04T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7378046
zbMATH Keywords: minimax quadratic optimization problem
zbMATH Keywords: SOCP relaxation
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: exact dual bound
zbMATH Keywords: positive definite matrix
author: O. A. Berezovskyi
MaRDI profile type: Publication
full work available at URL: s10559-021-00333-1
OpenAlex ID: W3127517610
cites work: Nondifferentiable optimization and polynomial problems
cites work: Constrained global optimization: algorithms and applications
cites work: Optimization of Structural and Mechanical Systems
cites work: Handbook of global optimization
cites work: Minimax quadratic optimization and its application to investment planning
cites work: Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain
cites work: Q4517108
cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems
cites work: Computational combinatorial optimization. Optimal of probably near-optimal solutions
cites work: On Lagrangian relaxation of quadratic matrix constraints
cites work: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
cites work: Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
cites work: Q4537750
cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems
cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
cites work: On the accuracy of dual bounds for quadratic extremum problems
cites work: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
cites work: Strong Duality in Robust Convex Programming: Complete Characterizations
cites work: Convex Relaxations of the Weighted Maxmin Dispersion Problem
cites work: Q3182207
cites work: Q4323601
cites work: Semidefinite programming relaxation for nonconvex quadratic programs
cites work: Exactness criteria for SDP-relaxations of quadratic extremum problems
DOI: 10.1007/S10559-021-00333-1
description: scientific article; zbMATH DE number 7378046