Strong duality for general quadratic programs with quadratic equality constraints
type: Item
instance of: scholarly article
title: Strong duality for general quadratic programs with quadratic equality constraints
author: Duy-Van Nguyen
published in: Journal of Optimization Theory and Applications
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7595950
zbMATH Keywords: quadratic programming
zbMATH Keywords: strong duality for nonconvex optimization
zbMATH Keywords: copositive matrices
MaRDI profile type: Publication
full work available at URL: s10957-022-02082-3
OpenAlex ID: W4293113683
cites work: Strong duality for a trust-region type relaxation of the quadratic assignment problem
cites work: Q3968042
cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
cites work: Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
cites work: Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
cites work: An Adaptive Linear Approximation Algorithm for Copositive Programs
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
cites work: Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
cites work: Canonical duality theory and solutions to constrained nonconvex quadratic programming
cites work: Q4357206
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams
cites work: Completely positive and copositive program modelling for quadratic optimization problems
cites work: Q4856871
cites work: Nondifferentiable optimization and polynomial problems
cites work: Lagrangian bounds in multiextremal polynomial and discrete optimization problems
cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
cites work: Duality bound method for the general quadratic programming problem with quadratic constraints
cites work: General Quadratic Programming
DOI: 10.1007/S10957-022-02082-3
description: scientific article; zbMATH DE number 7595950